Course Info

Course Coordinator J.F.M. Tonino

About this course

Study load (hrs)

Related information

Related TU Delft courses
Technische Informatica
Related resources
View related resources from other OCW-sites


OpenStudy Widget

Theory of Computation

Course Description: Computability Theory deals with one of the most fundamental questions in computer science: 

What is computing and what are the limits of what a computer can compute? 

Or, formulated differently: “What kind of problems can be algorithmically solved?” During the course this question will be studied. Firstly, the notion of algorithm or computing will be made precise by using the mathematical model of a Turing machine. Secondly, it will be shown that basic issues in computer science, like "Given a program P does it halt for any input x?" or "Given two program P and Q, are they equivalent?" cannot be solved by any Turing machine. This shows that there exist problems that are impossible to solve with a computer, the so-called "undecidable problems".

The book is in English, the recorded lectures and slides however, are in Dutch



Let us know what you think

Do you have a question? Have you run into any problems? Do you want to report a problem? Or do you have tips for us to improve TU Delft OpenCourseWare? TU Delft Bureau OpenER would love to hear what you have to say.
If the contact form does not show properly, please use the form on our contact page.

Please complete all requested information:
Thank you! After sending in your feedback, you'll be redirected to the TU Delft OpenCourseWare homepage.