CS-C2160 - Theory of Computation, 12.01.2021-14.04.2021
Kurssiasetusten perusteella kurssi on päättynyt 14.04.2021 Etsi kursseja: CS-C2160
Lecture 9. Decidability and undecidability
Suorituksen vaatimukset
1. Decidable and semi-decidable languages and problems. 2. Background: countable and uncountable sets.
3. Universal Turing machines and undecidable problems.