Graph centered on Universal Turing machine, showing the selected concept and its surrounding relations.Preparing the interactive atlas…

Keyboard graph navigation: press N for concepts or E for relations; use arrow keys, Home, and End to move; Enter selects; Shift plus Enter selects and centers; plus and minus zoom; zero fits; Escape clears the selection. Use the visible viewport buttons as alternatives to dragging, wheel, and pinch gestures.

Curated starting points

Stories & Views

Relationship-aware analysis

Compare concepts

Choose two concepts to compare or connect.
Reading the graph

Guide to the Atlas

Canonical static concept record

Universal Turing machine

Open this concept in the interactive graphRead the Markdown equivalent

Summary

A Turing machine that simulates any encoded Turing machine on encoded input.

Record metadata

Carrier(s)

Data

Canonically induces

Concept sources

Incoming relations (arrows to this concept)

Each relation below ends at this concept.

Turing machineUniversal Turing machine

Permalink to relation

This is an authored directed relation from the source endpoint to the target endpoint.

Authored explanation

A universal machine interprets encoded machines and their inputs.

How to interpret this relation type

A more specific theory, model, entity class, or regime is obtained by restricting or extending the scope of a broader framework.

Relation sources

  • Turing — On Computable Numbers — On Computable Numbers, with an Application to the Entscheidungsproblem · original research paper · source ID turing-computable-numbers

Outgoing relations (arrows from this concept)

Each relation below starts at this concept.

Universal Turing machineHalting problem

Permalink to relation

This is an authored directed relation from the source endpoint to the target endpoint.

Authored explanation

Encoding machines and inputs permits the decision problem asking whether the universal simulation of a given machine on a given input eventually halts.

How to interpret this relation type

Apply a standard functorial or canonical construction whose output is not merely a reduct of the input and is not generally an equivalent presentation of the same object.

Relation sources

  • Turing — On Computable Numbers — On Computable Numbers, with an Application to the Entscheidungsproblem · original research paper · source ID turing-computable-numbers