This lesson is for subscribers
You've completed the free preview. Subscribe to unlock every lesson in every course.
Lesson 1864 of 2,872·42. Turing Machines and ComputabilityPro lesson
Equivalence of Computational Models
How Turing machines, lambda calculus, and recursive functions compute exactly the same class of functions.