Statements (24)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:containsElement |
0 degree
0' (zero jump) degree computable degree noncomputable degree |
| gptkbp:describes |
level of unsolvability of sets of natural numbers
|
| gptkbp:field |
gptkb:logic
computability theory |
| gptkbp:hasProperty |
partially ordered set
upper semi-lattice |
| gptkbp:introducedIn |
1940s
|
| gptkbp:namedAfter |
gptkb:Alan_Turing
|
| gptkbp:relatedTo |
gptkb:arithmetical_hierarchy
gptkb:Turing_reducibility Technical Machine recursively enumerable sets computable functions |
| gptkbp:studiedBy |
gptkb:mathematician
logicians |
| gptkbp:usedIn |
recursion theory
theory of computation |
| gptkbp:bfsParent |
gptkb:Computability_theory
gptkb:arithmetical_hierarchy |
| gptkbp:bfsLayer |
6
|