ConceptTheory & Algos
Turing-decidable language
A language is Turing-decidable if some Turing machine that is a decider recognizes it.
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.