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
The decision problem asking whether an encoded Turing machine eventually halts on an encoded input.
wp-halting-problemturing-computable-numbersEach relation below ends at this concept.
This is an authored directed relation from the source endpoint to the target endpoint.
The halting problem is a specific undecidable decision problem: no total algorithm correctly decides termination for every encoded machine-input pair.
The target is a member or subtype of the broader source class.
turing-computable-numbersThis is an authored directed relation from the source endpoint to the target endpoint.
Encoding machines and inputs permits the decision problem asking whether the universal simulation of a given machine on a given input eventually halts.
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-numbersEach relation below starts at this concept.
No direct relations are authored in this direction.