How Much Information Can There Be in a Real Number?

DOI10.1007/978-3-642-27654-5_19zbMath1353.68143OpenAlexW2408265273MaRDI QIDQ2891316

Gregory J. Chaitin

Publication date: 15 June 2012

Published in: Computation, Physics and Beyond (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-27654-5_19

zbMATH Keywords

halting probabilityhalting problem

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Turing machines and related notions (03D10)

Cites Work

• Unnamed Item
• The halting probability Omega: irreducible complexity in pure mathematics
• EXACT APPROXIMATIONS OF OMEGA NUMBERS

This page was built for publication: How Much Information Can There Be in a Real Number?