论文信息 - The Halting Probability Omega: Irreducible Complexity in Pure Mathematics

The Halting Probability Omega: Irreducible Complexity in Pure Mathematics

Abstract.Some Gödel 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.

G. J. Chaitin | G. Chaitin

[1] Ugo Pagallo,et al. Teoria giuridica della complessità , 2006 .

[2] É. Borel. Leçons sur la théorie des fonctions , 2009 .

[3] Gregory Chaitin,et al. The limits of reason. , 2006, Scientific American.

[4] Gregory J. Chaitin,et al. Epistemology as Information Theory : From Leibniz to Ω ∗ , 2005 .

[5] G. J. Chaitin. Epistemology as Information Theory: From Leibniz to Omega , 2005 .

[6] Gregory J. Chaitin. How Real are Real Numbers? , 2006, Int. J. Bifurc. Chaos.