PP (complexity)

In computational complexity theory, PP stands for "Probabilistic Polynomial time." It is a complexity class that consists of decision problems for which there is a probabilistic Turing machine that can decide the problem with a certain level of accuracy.