Abstract
The Turing machine is a model introduced by Alan Turing which performs simple instructions for carrying out a computational task. Turing introduced that model to clarify what a mechanical process computes. We can be sure that what a Turing machine can compute is considered to be computed mechanically. The point of Turing’s argument is its converse: what can be computed mechanically can be computed by a Turing machine. Turing developed arguments to support this direction of thought.
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
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer-Verlag London Limited
About this chapter
Cite this chapter
Maruoka, A. (2011). Turing Machine. In: Concise Guide to Computation Theory. Springer, London. https://doi.org/10.1007/978-0-85729-535-4_6
Download citation
DOI: https://doi.org/10.1007/978-0-85729-535-4_6
Publisher Name: Springer, London
Print ISBN: 978-0-85729-534-7
Online ISBN: 978-0-85729-535-4
eBook Packages: Computer ScienceComputer Science (R0)