Sign inSign in

Probabilistic Turing machine

A PTM is a variant of a nondeterministic Turing machine where each computation step has 1 or 2 possible choices, with 50% probability assigned when there are two choices.
as Michael Sipser defines itMITThe wording closest to all 4 definitions
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

3

Each in their own terms, from the easiest level.

  • Michael Sipser

    MIT · Undergraduate

    • 2:55Probabilistic Computation, BPP
  • Venkatesan Guruswami

    Carnegie Mellon University · Undergraduate

    A Turing machine that makes random choices at each step, defined by two transition functions.
    • 1:00BPP (Bounded-Error Probabilistic Polynomial Time) Complexity Class
  • Ryan O'Donnell

    Carnegie Mellon University · Graduate

    A Turing machine that can flip a fair coin at each step of its computation.
    • 0:49Probabilistic Complexity Classes

Lectures that assume it

6

Connections

19

The lectures that define it or assume it, and the concepts next to it.

3 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.