Editing Turing machine (section)

==See also==
{{divcol|colwidth=22em}}
* [[Arithmetical hierarchy]]
* [[Bekenstein bound]], showing the impossibility of infinite-tape Turing machines of finite size and bounded energy
* [[BlooP and FlooP]]
* [[Chaitin's constant]] or [[Omega (computer science)]] for information relating to the halting problem
* [[Chinese room]]
* [[Conway's Game of Life]], a Turing-complete cellular automaton
* [[Digital infinity]]
* ''[[The Emperor's New Mind]]''
* [[Enumerator (in theoretical computer science)]]
* [[Genetix]]
* ''[[Gödel, Escher, Bach: An Eternal Golden Braid]]'', a famous book that discusses, among other topics, the Church–Turing thesis
* [[Halting problem]], for more references
* [[Harvard architecture]]
* [[Imperative programming]]
* [[Langton's ant]] and [[Turmite]]s, simple two-dimensional analogues of the Turing machine
* [[List of things named after Alan Turing]]
* [[Modified Harvard architecture]]
* [[Quantum Turing machine]]
* [[Claude Shannon]], another leading thinker in information theory
* [[Turing machine examples]]
* [[Turing tarpit]], any computing system or language that, despite being Turing complete, is generally considered useless for practical computing
* [[Unorganized machine|Unorganised machine]], for Turing's very early ideas on neural networks
* [[Von Neumann architecture]]

{{divcol-end}}