Turing, Church, Gödel, Computability, Complexity and Randomization: A Personal View

author: Michael O. Rabin, Harvard University
published: July 10, 2012,   recorded: June 2012,   views: 17392

Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.


The above named have innovated the concept of computability in the mid ninety-thirties. Alan Turing gave his definition of computability via a creation of a model of a universal stored program computer. The distinction between computable and non-computable functions was subsequently refined by a discussion of the inherent complexity of computable functions. The speaker will draw from his personal interaction with Church, Gödel and the people working with John von-Neumann a picture of the evolution of computing as well as give a perspective of the future of computer science and technology.

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: