ConceptTheory & Algos
Turing decidable
A language is Turing decidable if it is the set of all strings accepted by some Turing machine that halts on all inputs.
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
1Michael Sipser
Connections
6The lectures that define it or assume it, and the concepts next to it.