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