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 whose characteristic function is total computable.
wp-decidable-problemturing-computable-numbersEach relation below ends at this concept.
This is an authored directed relation from the source endpoint to the target endpoint.
A decision problem is decidable when some algorithm halts with the correct answer on every input.
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.
If a decision problem is decidable, its set of yes-instances is computably enumerable; run the decider through an effective enumeration of inputs and output those accepted.
Record a genuine theorem implication that is not part of the target definition; these edges may point toward a weaker structure.
turing-computable-numbers