Revisiting Chaitin's incompleteness theorem

DOI10.1215/00294527-2021-0006OpenAlexW3172899346MaRDI QIDQ1982000FDOQ1982000

Authors: Christopher P. Porter 

Publication date: 7 September 2021

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1215/00294527-2021-0006

Recommendations

• On interpreting Chaitin's incompleteness theorem
• scientific article; zbMATH DE number 6845503
• On the incompleteness theorems
• scientific article; zbMATH DE number 2222027
• Another look at the second incompleteness theorem
• Remarks on the Incompleteness Proof
• The second incompleteness theorem: reflections and ruminations
• The incompleteness theorems after 70 years
• A reformulation of Chichilnisky's impossibility theorem
• Gödel's incompleteness theorems from a paraconsistent perspective

zbMATH Keywords

Kolmogorov complexityalgorithmic randomnessincompleteness theorems

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Algorithmic randomness and dimension (03D32) Gödel numberings and issues of incompleteness (03F40)

Cites Work

• Title not available (Why is that?)
• Algorithmic randomness and complexity.
• Computability and randomness
• The definition of random sequences
• Title not available (Why is that?)
• An introduction to Kolmogorov complexity and its applications
• The axiomatic power of Kolmogorov complexity
• Information-Theoretic Limitations of Formal Systems
• On interpreting Chaitin's incompleteness theorem
• Inexhaustibility: A non-exhaustive treatment
• Turing computability. Theory and applications
• Gödel's theorem and information
• Is complexity a source of incompleteness?
• The Borel-Cantelli lemmas, probability laws and Kolmogorov complexity
• Algorithms and Randomness
• Meta math! The quest for omega
• On analogues of the Church-Turing thesis in algorithmic randomness
• Algorithmic information theory
• Randomness Is Unpredictability
• Stationary algorithmic probability
• Title not available (Why is that?)
• On explicating the concept `the power of an arithmetical theory'
• The Source of Chaitin's Incorrectness
• The equivalence of definitions of algorithmic randomness

Cited In (4)

• The incompleteness theorems after 70 years
• Non-erasing Variants of the Chomsky–Schützenberger Theorem
• Title not available (Why is that?)
• The incompleteness of Misra and Chandy's proof systems

This page was built for publication: Revisiting Chaitin's incompleteness theorem

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