Other important complexity classes include BPP, ZPP and RP, which are defined using probabilistic Turing machines; AC and NC, which are defined using Boolean circuits; and BQP and QMA, which are defined using quantum Turing machines.
What are three examples of complexity classes associated with definitions established by probabilistic Turing machines?
BPP, ZPP and RP