KnowraTuring machineLinked fromLinked fromThe 53 pages that link to Turing machine, each with the reason it gives.All 53Broader topic 9Related 23Narrower topic 13Compared with 8Finite-state machineCompared with: Its unbounded tape contrasts with the finite memory of a finite-state machine.Lambda calculusCompared with: Its independent model of computation helped establish lambda calculus as computationally equivalent in power.Pushdown automatonCompared with: Its tape is more flexible than a pushdown automaton’s restricted stack.Deterministic finite automatonCompared with: Its unbounded tape enables computation beyond finite-state memory.Finite automatonCompared with: Its unbounded memory allows computations finite automata cannot perform.Digital computerCompared with: It captures computability in theory rather than describing a practical digital computer.Analog computerCompared with: It formalizes discrete computation, unlike analog computers that calculate through physical magnitudes.State machineCompared with: Its unbounded memory gives it computational power beyond finite-state machines.