Intermediate
Theory of Computation
Q67 / 100
What is an oracle Turing machine?
Correct! Well done.
Incorrect.
The correct answer is B) A TM augmented with an oracle (black box) that answers queries about a fixed language in one step
B
Correct Answer
A TM augmented with an oracle (black box) that answers queries about a fixed language in one step
Explanation
Oracle TMs are used to define relative complexity: Pᴬ means P with access to oracle A. Baker-Gill-Solovay showed there exist oracles A where Pᴬ = NPᴬ and oracles B where Pᴮ ≠ NPᴮ.
Progress
67/100