ConceptTheory & Algos
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.
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
3Each in their own terms, from the easiest level.
Michael Sipser
Venkatesan Guruswami
A Turing machine that makes random choices at each step, defined by two transition functions.Ryan O'Donnell
A Turing machine that can flip a fair coin at each step of its computation.
Lectures that assume it
6Connections
19The lectures that define it or assume it, and the concepts next to it.
Concepts9
- Turing machine
- Non-deterministic Turing machine
- Nondeterministic Turing machine
- Transition function
- Bounded-error probabilistic polynomial time
- BPP