Chapter 9: Q22P (page 390)
Suppose that A and B are two oracles. One of them is an oracle for TQBF, but if you don’t know which. Give an algorithm that has access to both A and B, and that is guaranteed to solve TQBF in polynomial time.
Short Answer
An oracle machine is a type of Turing Machine having many different tapes and these tapes are called oracle tapes. The different states may be represented .