Important announcement

Dear visitor,

Please note that this OpenCourseWare platform will be replaced at the end of 2026 by a new platform (under the same url ocw.tudelft.nl).

Courses and their contents that are currently available the platform will partly be migrated. URL’s for this content will change and content might be unavailable for some time. In addition, some courses will not be available anymore.

If you are linking to specific courses on this platform (for instance for your students), please take timely measures to avoid problems with access. Possible actions are:

  • Download the materials to your local platform (laptop, server)
  • For educators only (including TU Delft lecturers): Contact us at ocw@tudelft.nl and inform us what course you are using in what context (institute, program, period of use, number of students). We will research (in collaboration with the authors of the course) and decide if we will migrate the course, and if yes, can supply you with a new url.

Thank you.

Home Courses Theory of Computation Course materials Lectures 3.B: Decidable problems, the Halting Problem and its undecidability, and Universal Turing Machines

3.B: Decidable problems, the Halting Problem and its undecidability, and Universal Turing Machines

Course week(s) Week 3
Course subject(s) 3: Decidabillity

Description: Some decidability results concerning finite automata and context-free languages are discussed. An informal proof of the undecidability of the Halting Problem is presented. The acceptance problem is introduced and its undecidability is demonstrated. Here the notion of Universal Turing Machine is (implicitly) used: a Turing machine can execute programmes stored with their application data on its input tape.

Book: Introduction to the Theory of Computability, Chapter 4, pp. 167-176, 181-184.

Exercises: 4.1 (abcef), 4.3-4.9, 4.16-4.18 and 4.18.

Key concepts:

  • Decidable Problems concerning Regular Languages and Context-free Languages
  • Halting Problem
  • Acceptability Problem
  • Universal Turing Machines
Module 3B
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
[sg_popup id=6]