BPP

Bounded-error Probabilistic Polynomial time: a grouping of problems in computational complexity theory. This is the class of problems that can be solved efficiently on a conventional computer with a true random-number source.