Linked from

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

• Turing machineBroader topic: It shows how one machine can execute encoded descriptions of other machines.

• Alan TuringBroader topic: It formalized the idea of one programmable machine executing many different procedures.

• Halting problemRelated: A single program can inspect and simulate arbitrary encoded programs.

• Church–Turing thesisBroader topic: Universality shows that one machine can carry out every Turing-machine computation.

• Computability theoryRelated: Universal simulation lets programs be treated as data in undecidability proofs.

• Kolmogorov complexityBroader topic: Its fixed simulation overhead explains why the choice of universal computer changes complexity only by a constant.

• Algorithmic information theoryRelated: Its choice defines program lengths, while invariance limits differences between choices.

• Minimum description lengthRelated: Algorithmic description length is defined relative to a universal machine.

• Kleene's recursion theoremRelated: Universal simulation lets a constructed program use encoded descriptions as data.

• General recursive functionRelated: Its partial input-output behavior exemplifies the functions captured by general recursion.

• S-m-n theoremRelated: Universal simulation gives a concrete setting for describing programs by indices.

• Theory of computationBroader topic: It explains how one general-purpose machine can execute encoded programs.

• Infinite monkey theoremCompared with: Computational universality concerns executing encoded programs, not randomly stumbling on their outputs.

• Turing's proofRelated: Universal simulation lets the construction inspect and imitate the behavior of arbitrary machines.