The Omega Number: Irreducible Complexity in Pure Math

DOI10.1007/11812289_1MaRDI QIDQ5756762zbMATH OpenOpenAlexFDO

Authors Gregory J. Chaitin

Publication date 5 September 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11812289_1

Mathematics Subject Classification ID

Philosophy of mathematics (00A30) Undecidability and degrees of sets of sentences (03D35) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• The halting probability Omega: irreducible complexity in pure mathematics
• Chaitin numbers and halting problems
• Meta math! The quest for omega. Translated from the English by Laurence Decréau
• How much information can there be in a real number?
• scientific article; zbMATH DE number 5252382

Cited in

(3)

• How much information can there be in a real number?
• Meta math! The quest for omega. Translated from the English by Laurence Decréau
• The halting probability Omega: irreducible complexity in pure mathematics

This page was built for publication: The Omega Number: Irreducible Complexity in Pure Math

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756762)