Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:category |
mathematical relation
|
| gptkbp:defines |
A set A is Turing reducible to set B if A can be decided by a Turing machine with an oracle for B.
|
| gptkbp:describes |
relative computability
|
| gptkbp:field |
gptkb:logic
computability theory |
| gptkbp:generalizes |
many-one reducibility
|
| https://www.w3.org/2000/01/rdf-schema#label |
Turing reducibility
|
| gptkbp:namedAfter |
gptkb:Alan_Turing
|
| gptkbp:relatedTo |
Technical Machine
oracle machine |
| gptkbp:symbol |
≤_T
|
| gptkbp:type |
reducibility
|
| gptkbp:usedIn |
gptkb:complexity_theory
recursion theory |
| gptkbp:bfsParent |
gptkb:Turing_degree
gptkb:Turing_degrees gptkb:Degrees_of_Unsolvability |
| gptkbp:bfsLayer |
7
|