The Omega Number: Irreducible Complexity In Pure Math

Gregory J. Chaitin, IBM Watson Research Center, New York

We'll discuss the halting probablity Omega, whose bits are irreducible mathematical facts, that is, facts which cannot be derived from any principles simpler than they are.
In other words, you need a mathematical theory with N bits of axioms in order to be able to determine N bits of Omega.

Audio