Statements (29)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
computability theory concept
reduction |
| gptkbp:allows |
multiple queries to the oracle
|
| gptkbp:alsoKnownAs |
oracle reduction
|
| gptkbp:category |
gptkb:logic
computability theory |
| gptkbp:contrastsWith |
gptkb:many-one_reduction
polynomial-time reduction 1-reduction truth-table reduction |
| gptkbp:defines |
A Turing reduction is a method for reducing one decision problem to another using an oracle Turing machine.
|
| gptkbp:describes |
relative computability
|
| gptkbp:field |
gptkb:logic
computability theory |
| gptkbp:generalizes |
gptkb:many-one_reduction
|
| https://www.w3.org/2000/01/rdf-schema#label |
Turing reduction
|
| gptkbp:introducedIn |
1939
|
| gptkbp:isWeakerThan |
gptkb:many-one_reduction
no reduction truth-table reduction |
| gptkbp:namedAfter |
gptkb:Alan_Turing
|
| gptkbp:notation |
A ≤_T B
|
| gptkbp:relatedTo |
gptkb:oracle_Turing_machine
gptkb:many-one_reduction computable function |
| gptkbp:usedIn |
recursion theory
theoretical computer science |
| gptkbp:bfsParent |
gptkb:Karp_reduction
|
| gptkbp:bfsLayer |
5
|