We show that for determinictic polynomial time computation, oracle access to
\mathbf{APP}, the class of real functions
approximable by probabilistic Turing machines, is the same as having oracle access to
promise-\mathbf{BPP}. First
we construct a mapping that maps every function in \mathbf{APP} to a promise problem
more >>>