The Halting Probability Omega: Irreducible Complexity in Pure Mathematics
History and Overview
2007-05-23 v1
Abstract
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.]
Cite
@article{arxiv.math/0611740,
title = {The Halting Probability Omega: Irreducible Complexity in Pure Mathematics},
author = {G. J. Chaitin},
journal= {arXiv preprint arXiv:math/0611740},
year = {2007}
}