input: Background: 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. #P is an important complexity class of counting problems (not decision problems). Classes like IP and AM are defined using Interactive proof systems. ALL is the class of all decision problems.
  Question: What are three examples of complexity classes associated with definitions established by probabilistic Turing machines?
  Answer:<extra_id_0>.
output: <extra_id_0> BPP, ZPP and RP<extra_id_1>