Abstract
In order to formalize the concept of an algorithm, Turing suggested a mathematical model of a computing machine [71]. Turing Machine is an abstract computing device consisting of a tape, a reading and printing head and a control device. The Turing machine is not the only way to formalize the concept of an algorithm. Similar approaches are known, leading to equivalent results, among which we should mention the Post machine and the Markov normal algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Alan Mathison Turing (1912–1954)—English mathematician and logic.
- 2.
Alonzo Church (1903–1995)—American mathematician and logician.
- 3.
Andrei Andreevich Markov-jr. (1903–1979)—Soviet mathematician and logician.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Kurgalin, S., Borzunov, S. (2020). Turing Machine. In: The Discrete Math Workbook. Texts in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-030-42221-9_10
Download citation
DOI: https://doi.org/10.1007/978-3-030-42221-9_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-42220-2
Online ISBN: 978-3-030-42221-9
eBook Packages: Computer ScienceComputer Science (R0)