ConceptTheory & Algos
Decider
A Turing machine that halts on every input.
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
2Each in their own terms, from the easiest level.
Ryan O'Donnell
A Turing machine M is a decider if M on X halts for all X without getting into an infinite loop.Michael Sipser
A Turing machine is a decider if it halts on every input string.
Lectures that assume it
4Connections
17The lectures that define it or assume it, and the concepts next to it.
Concepts8
- Turing machine
- Halting configuration
- Halting problem
- Turing decidable
- Decides/Solves a language
- Non-deterministic decider