scientific article

zbMATH Open1019.68047arXivmath/0203002MaRDI QIDQ3152803FDOQ3152803

Authors: Gregory J. Chaitin 

Publication date: 10 December 2002

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

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

metamathematicshalting probabilityTuring's halting problem

Mathematics Subject Classification ID

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

Cited In (16)

• Metamathematics and the Philosophical Tradition
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Metaphysics, metamathematics and metabiology
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Constructivism and Metamathematics
• New directions in the foundations of mathematics (2002)
• A metasemantic challenge for mathematical determinacy
• Metamathematical limits to computation
• The halting probability Omega: irreducible complexity in pure mathematics
• Перспективы метаматематических структур в науке
• Title not available (Why is that?)

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)