Course contentsShow
Computer Science
Lesson 1860 of 2,87242. Turing Machines and ComputabilityPro lesson

The Quest for a Formal Definition of Algorithm

Understanding why mathematicians sought a precise definition of 'effective computability' in the 1930s.

This lesson is for subscribers

You've completed the free preview. Subscribe to unlock every lesson in every course.