The ideas in Alan Turing's paper "On Computable Numbers, with an Application to the Entscheidungsproblem" have revolutionised the world we live in and have affected us all. In this talk I will explain these ideas and their connection to Goedel's Incompleteness Theorem, the Halting Problem, Chaitin's number Omega, and Kolmogorov complexity.

Colloquia are designed to be of interest to a general mathematical audience and to be accessible without specialist knowledge. There will be wine and cheese afterwards.
 

Convenor: Ian Wanless - firstname.lastname@sci.monash.edu.au