ConceptTheory & Algos
Decides/Solves a language
A Turing machine M decides or solves a language L if it is a decider and accepts all strings in the language while rejecting all 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.