The Halting Probability Omega: Irreducible Complexity in Pure   Mathematics
  Some Goedel centenary reflections on whether incompleteness is really serious, and whether mathematics should be done somewhat differently, based on using algorithmic complexity measured in bits of information. [Enriques lecture given Monday, October 30, 2006, at the University of Milan.] 
G. J. Chaitin (IBM Research)