Toda's theorem
The polynomial hierarchy is contained in probabilistic Turing machine in polynomial time / From Wikipedia, the free encyclopedia
Toda's theorem is a result in computational complexity theory that was proven by Seinosuke Toda in his paper "PP is as Hard as the Polynomial-Time Hierarchy"[1] and was given the 1998 Gödel Prize.