Bounded-error randomized Turing machine

Home > Computer Science > Theory of Computation > Turing Machines > Bounded-error randomized Turing machine

A bounded-error randomized Turing machine (BRTM) is a variant of probabilistic Turing machine that can solve some problems with a small error probability.