ConceptTheory & Algos
Alternating Turing machine (ATM) type
An ATM is of a specific Sigma or Pi type based on the quantifier sequence of its guessing phases along computation branches.
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.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.