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