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.
Canonical static concept record
Open this concept in the interactive graphRead the Markdown equivalent
A finite-state abstract machine with a read-write tape and transition rules, used to define effective computation.
wp-turing-machinenlab-turing-machineturing-computable-numbersEach relation below ends at this concept.
This is an authored directed relation from the source endpoint to the target endpoint.
A Turing machine is one precise mathematical model of a finitely specified mechanical procedure; identifying it with the full informal notion of algorithm invokes the Church–Turing thesis.
A more specific theory, model, entity class, or regime is obtained by restricting or extending the scope of a broader framework.
turing-computable-numbersEach relation below starts at this concept.
This is an authored directed relation from the source endpoint to the target endpoint.
Each deterministic Turing machine induces a partial function by its input-output behavior; machines that halt on every input compute total functions.
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.
turing-computable-numbersThis is an authored directed relation from the source endpoint to the target endpoint.
A Turing machine determines a computably enumerable set by accepting exactly its members, equivalently by enumerating them.
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.
turing-computable-numbersThis is an authored directed relation from the source endpoint to the target endpoint.
A universal machine interprets encoded machines and their inputs.
A more specific theory, model, entity class, or regime is obtained by restricting or extending the scope of a broader framework.
turing-computable-numbers