Alan Turing on Computability and Intelligence
Below are links to Peter Millican's lectures from summer 2018, categorised by topic. The handouts are suitable for printing with six slides per page:
About the Course
This course is specially designed for first year undergraduates studying Computer Science & Philosophy at Oxford (though others, including postgraduates, are welcome to attend the lectures and often do). It is focused especially on Alan Turing's two most seminal papers, from 1936 and 1950, but starts with important background material on Cantor and Gödel to set the scene.
Handouts for All Eight Lectures
- Complete Handouts for 2018 Lectures (from PowerPoint slides)
- Complete Handouts for 2019 Lectures (with a few corrections/additions)
- Complete Handouts for 2025 Lectures (substantially revised, though the material on Turing's 1936 paper is relatively unchanged)
- Complete PowerPoint Slides for 2025 Lectures
Links to the Individual Lectures
- Types of number, Cantor, infinities, diagonal arguments (Lecture 1, 57 mins)
- Hilbert's Programme and Gödel's Theorem (Lecture 2, 49 mins)
- "On Computable Numbers" – Turing's 1936 Paper (Lecture 3, 50 mins)
- Enumerating the Computable Numbers, and the Universal Turing Machine (Lecture 4, 53 mins)
- Settling Hilbert's Entscheidungsproblem, and the Halting Problem (Lecture 5, 57 mins)
- "Computing Machinery and Intelligence" – Overview of Turing's 1950 paper (Lecture 6, 50 mins)
- Blockhead, the Chinese Room, and ELIZA (Lecture 7, 55 mins)
- Searle versus Turing – Conclusion (Lecture 8, 60 mins)