CS-C2160 - Theory of Computation, 12.01.2021-14.04.2021
This course space end date is set to 14.04.2021 Search Courses: CS-C2160
Lecture 9. Decidability and undecidability
Krav för slutförande
1. Decidable and semi-decidable languages and problems. 2. Background: countable and uncountable sets.
3. Universal Turing machines and undecidable problems.