Let $A$ be any EXP complete problem. Then, $P^A = NP^A$.Let $B$ be some oracle that takes into accounts the queries that $M$ (a TM in P) will make, and we can get $P^B \neq NP^B$.Question: Do we have similar oracle results for P vs BPP?
Oracle results on P vs BPP
cc.complexity theory;oracles;relativization