Abstract
We discuss the halting probability Ω, 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 Ω. This pathological property of Ω is difficult to reconcile with traditional philosophies of mathematics and with traditional views of the nature of mathematical proof and of mathematical knowledge. Instead Ω suggests a quasi-empirical view of math that emphasizes the similarities between mathematics and physics rather than the differences.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chaitin, G.J. (2006). The Omega Number: Irreducible Complexity in Pure Math. In: Borwein, J.M., Farmer, W.M. (eds) Mathematical Knowledge Management. MKM 2006. Lecture Notes in Computer Science(), vol 4108. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11812289_1
Download citation
DOI: https://doi.org/10.1007/11812289_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37104-5
Online ISBN: 978-3-540-37106-9
eBook Packages: Computer ScienceComputer Science (R0)