ConceptTheory & Algos
Randomized Turing machine
A probabilistic Turing machine is a normal Turing machine defined with two transition functions rather than one, choosing between them uniformly at random at each step.
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.
Deterministic Turing machine1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Lectures that assume it
1Connections
4The lectures that define it or assume it, and the concepts next to it.