Education
TI2320 (IN2505-II). Berekenbaarheidstheorie. "The notions of decidability and recognisability for non-deterministic Turing machines are defined. König's Lemma is explained and its use is shown in the proof of the computational equivalence of non-deterministic Turing machines and ordinary Turing machines. It is argued how non-deterministic Turing machines for solving a specific problem can be constructed by breaking up the problem in first guessing a solution and then checking its validity."