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.

3.A: Infinity, hotel Hilbert, and countable and uncountable sets

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

Description: Hotel Hilbert is a story of infinity and how to calculate with countable, infinite sets. Cantor’s proof of the uncountability of the set of real numbers is presented using the famous technique of diagonalisation. Other examples of uncountable sets are given. The existence of languages that are not Turing recognisable is demonstrated.

Book: Introduction to the Theory of Computability, Chapter 4, pp. 176-180.

Exercises: 4.5, 4.6, 4.7 and 4.8

Key concepts:

  • Diagonalization
  • Hilbert’s Hotel
  • Two Degrees of Infinity
  • Countable and Uncountable Sets
  • Uncountability of the Reals
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]