ConceptTheory & Algos
Church-Turing thesis
Any real-world algorithm can be simulated or compiled by Turing machines.
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
3Each in their own terms, from the easiest level.
Michael Sipser
The hypothesis that the intuitive notion of an algorithm is exactly captured by the formal definition of a Turing machine.John Carlos Baez
The claim that any function from the natural numbers to itself that you can compute by any systematic procedure whatsoever is actually computable by a Turing machine.
Lectures that assume it
1Connections
8The lectures that define it or assume it, and the concepts next to it.