This lesson is for subscribers
You've completed the free preview. Subscribe to unlock every lesson in every course.
Lesson 1865 of 2,872·42. Turing Machines and ComputabilityPro lesson
Statement of the Church-Turing Thesis
The thesis: every effectively computable function is computable by a Turing machine (or equivalent model).