Turing machine  

From The Art and Popular Culture Encyclopedia

Related e

Wikipedia Wiktionary Shop Featured: Rhombicuboctahedron by Leonardo da Vinci

A Turing machine is an abstract machine that manipulates symbols on a strip of tape according to a table of rules; to be more exact, it is a mathematical model of computation that defines such a device.

See also

• Algorithm, for a brief history of some of the inventions and the mathematics leading to Turing's definition of what he called his "a-machine"
• Arithmetical hierarchy
• Bekenstein bound, showing the impossibility of infinite-tape Turing machines of finite size and bounded energy
• BlooP and FlooP
• Busy beaver
• Chaitin constant or Omega (computer science) for information relating to the halting problem
• Church–Turing thesis, which says Turing machines can perform any computation that can be performed
• Claude Shannon, another leading thinker in information theory
• Conway's Game of Life, a Turing-complete cellular automaton
• Digital infinity
• Enumerator (in theoretical computer science)
• Gödel, Escher, Bach: An Eternal Golden Braid, a famous book that discusses, among other topics, the Church–Turing thesis
• The Emperor's New Mind
• Halting problem, for more references
• Harvard architecture
• Imperative programming
• Langton's ant and Turmites, simple two-dimensional analogues of the Turing machine
• Modified Harvard architecture
• Probabilistic Turing machine
• Unorganized machine, for Turing's very early ideas on neural networks
• Quantum Turing machine
• Turing completeness, an attribute used in computability theory to describe computing systems with power equivalent to a universal Turing machine
• Turing machine examples
• Turing switch
• Turing tarpit, any computing system or language that, despite being Turing complete, is generally considered useless for practical computing
• Von Neumann architecture