Statements (22)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:describes |
relative computability
|
| gptkbp:field |
gptkb:logic
recursion theory |
| gptkbp:hasApplication |
gptkb:logic
theory of computation |
| https://www.w3.org/2000/01/rdf-schema#label |
Degrees of Unsolvability
|
| gptkbp:introduced |
gptkb:Emil_Post
|
| gptkbp:relatedTo |
gptkb:arithmetical_hierarchy
gptkb:hyperarithmetical_hierarchy gptkb:Post's_problem gptkb:Turing_reducibility computability theory recursively enumerable sets computable functions unsolvable problems Turing degree many-one reducibility |
| gptkbp:studies |
classification of decision problems
relative difficulty of algorithmic problems |
| gptkbp:bfsParent |
gptkb:Robert_L._Constable
|
| gptkbp:bfsLayer |
6
|