The Halting Probability Omega: Irreducible Complexity in Pure Mathematics
classification
🧮 math.HO
keywords
complexitymathematicswhetheralgorithmicbitscentenarydifferentlydone
read the original 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.]
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.