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 set whose members can be enumerated by a Turing machine, equivalently whose membership is semidecidable.
wp-recursively-enumerable-setturing-computable-numbersEach relation below ends 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-numbersThis is an authored directed relation from the source endpoint to the target endpoint.
For an effectively axiomatized proof system with mechanically checkable finite proofs, the Gödel numbers of its theorems form a computably enumerable set.
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.
openlogic-incompletenessturing-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-numbersEach relation below starts at this concept.
No direct relations are authored in this direction.