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

Creative Commons License
Theory of Computation by TU Delft OpenCourseWare is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Based on a work at https://ocw.tudelft.nl/courses/theory-of-computation/.
Back to top

Help us improve TU Delft OpenCourseWare

Help us to get to know you and your ideas on how to improve the OCW website. If you take 5 minutes and fill out our survey, you would be very helpful.

Open Survey