scientific article; zbMATH DE number 1820020

MaRDI QIDQ3152803zbMATH OpenFDO

Authors Gregory J. Chaitin

Publication date 10 December 2002

Full work available at URL https://arxiv.org/abs/math/0203002

zbMATH Keywords

metamathematicshalting probabilityTuring's halting problem

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• The halting probability Omega: irreducible complexity in pure mathematics
• scientific article; zbMATH DE number 5187689
• scientific article; zbMATH DE number 6845503
• Algorithmic information theory
• Publication:4942040

Cited in

(16)

• Metamathematics and the Philosophical Tradition
• scientific article; zbMATH DE number 7583721 (Why is no real title available?)
• scientific article; zbMATH DE number 2236634 (Why is no real title available?)
• scientific article; zbMATH DE number 1042847 (Why is no real title available?)
• Metaphysics, metamathematics and metabiology
• scientific article; zbMATH DE number 2101960 (Why is no real title available?)
• scientific article; zbMATH DE number 4195939 (Why is no real title available?)
• scientific article; zbMATH DE number 5859773 (Why is no real title available?)
• scientific article; zbMATH DE number 3177714 (Why is no real title available?)
• Constructivism and Metamathematics
• A metasemantic challenge for mathematical determinacy
• New directions in the foundations of mathematics (2002)
• Metamathematical limits to computation
• The halting probability Omega: irreducible complexity in pure mathematics
• Перспективы метаматематических структур в науке
• scientific article; zbMATH DE number 1390282 (Why is no real title available?)

This page was built for publication:

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