Education
TI2320 (IN2505-II). Berekenbaarheidstheorie. "Enumerability is introduced as an alternative to recognisability: the Turing machine as an enumerator instead of as a recogniser. The proof of equivalence of both notions uses the so-called technique of "dove tailing". A first, seemingly simple, undecidable language is presented: Hilbert's tenth problem."