The complexity class PP, which contains problems solvable by a probabilistic Turing machine with bounded error, is surprisingly powerful; it's even more powerful than NP, meaning some problems in PP are provably harder to solve than those in NP, despite the seeming simplicity of its definition in th elaborate