ConceptTheory & Algos
Turing recognizable
A language is Turing-recognizable if there exists a Turing machine that accepts all strings in the language.
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
1Michael Sipser
Lectures that assume it
1Connections
5The lectures that define it or assume it, and the concepts next to it.