Latest Topics
Random Topics
|
Turing reduction
Summary
- In computability theory, a Turing reduction from a problem A to a problem B is, intuitively, a reduction which easily solves A, assuming B is easy to solve. More formally, a Turing reduction is a function computable by an oracle machine with an oracle for B.
|
| | Soundex: T652 ( T652 R323 )
Metaphone: TRNKRTKXN
Reference
|
Similar Topics
Related Topics
* This page is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Turing reduction".
|