KnowraUniversal Turing machineLinked fromLinked fromThe 14 pages that link to Universal Turing machine, each with the reason it gives.All 14Broader topic 5Related 8Compared with 1Halting problemRelated: A single program can inspect and simulate arbitrary encoded programs.Computability theoryRelated: Universal simulation lets programs be treated as data in undecidability proofs.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.Turing's proofRelated: Universal simulation lets the construction inspect and imitate the behavior of arbitrary machines.