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 decision problem for which no algorithm halts on every input with the correct yes-or-no answer.
wp-undecidable-problemturing-computable-numbersEach relation below ends at this concept.
This is an authored directed relation from the source endpoint to the target endpoint.
An undecidable problem is a decision problem for which no total algorithm returns the correct yes-or-no answer on every encoded instance.
The target is a member or subtype of the broader source class.
turing-computable-numbersEach relation below starts 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-numbers