Concepts
Turing Machine
Also Known As a-machine (automatic machine)
Citation Formats
General Reference
APA Style
BibTeX
A Turing machine is a mathematical model of computation described by Alan Turing in his 1936 paper On Computable Numbers, consisting of an infinite tape divided into cells, a read write head that moves along the tape, and a finite table of rules the head follows based on the symbol it reads and its own current state. Despite its extreme simplicity, the model is powerful enough to describe any computation a modern computer can perform, a claim known as the Church Turing thesis after Turing and Alonzo Church, who independently reached an equivalent result the same year using a different formalism, the lambda calculus.
Facts
Core PrincipleA simple formal model, an infinite tape and a finite rule table, powerful enough to describe any computation a general purpose computer can perform. 1 Cross-Tradition Connections
Associated With
In Field
Invented By
Sources
Reader Challenges (0 open reader challenges)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.
View At A Past Year
The atlas records no dated fact of its own for this entry, so there is no other year to choose.