ConceptSystems & CS
Halting theorem
The theorem proving that there is no general procedure or machine that can solve the halting problem for all possible programs.
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
1Hal Abelson & Gerald Jay Sussman
Connections
5The lectures that define it or assume it, and the concepts next to it.