Education
TI2320 (IN2505-II). Berekenbaarheidstheorie. "Hilbert's Entscheidungsproblem is undecidable! The common belief that the intuitive notion of computability is adequately modelled by the formal notion of Turing machine (defined by Alan Turing) or by the lambda calculus (invented by Alonzo Church) is called the Church-Turing Thesis. Turing machines and problems can be coded as natural numbers (or otherwise): a programme is a natural number!"