On the information-theoretic approach to Gödel's incompleteness theorem

2002/11/05 by Germano D’Abramo, D'Abramo, Germano
Computer Science · Physics and Astronomy · #Advanced Algebra and Logic #Computability, Logic, AI Algorithms #FOS: Mathematics #History and Overview (math.HO) #Statistical Mechanics and Entropy

paper · pdf · doi:10.48550/arxiv.math/0211078

openalex publication_date 2002/11/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper we briefly review and analyze three published proofs of Chaitin's theorem, the celebrated information-theoretic version of Gödel's incompleteness theorem. Then, we discuss our main perplexity concerning a key step common to all these demonstrations.

Related

• An Intuitively Complete Analysis of Godel's Incompleteness
• A proof of Gödel's incompleteness theorems using Chaitin's incompleteness theorem
• A Note on the Incompleteness of Gödel's Incompleteness Theorems
• On Gödel's second incompleteness theorem
• Incompleteness Ex Machina