Computational complexity theory models randomized algorithms as probabilistic Turing machines.
The class of problems for which both YES and NO-instances are allowed to be identified with some error is called BPP.