Information-Theoretic Incompleteness

DOI10.1142/1861zbMath0782.68005OpenAlexW4230306965MaRDI QIDQ5287534

Gregory J. Chaitin

Publication date: 9 July 1993

Full work available at URL: https://doi.org/10.1142/1861

zbMATH Keywords

algorithmic information theoryincompletenessrandomnessHilbert's tenth problemhalting problems

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items

COMPLEXITY, INFORMATION, ENERGY, LISP program-size complexity. II, Information-theoretic characterizations of recursive infinite strings, Incompleteness and the halting problem