ConceptTheory & Algos
Turing-recognizability
A property of a language for which a Turing machine can accept every string in the language, though it may loop on strings not 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
1Lectures that assume it
1Connections
6The lectures that define it or assume it, and the concepts next to it.