Linked from

The 53 pages that link to Turing machine, each with the reason it gives.

• Model of computationBroader topic: It is the canonical model for formalizing algorithms and computability.

• Trakhtenbrot's theoremRelated: Undecidable halting behavior supplies the computational problem encoded by the theorem.

• Turing's proofNarrower topic: Turing formalizes algorithms as machines whose halting behavior can be analyzed.