Information-Theoretic Incompleteness

DOI10.1142/1861zbMATH Open0782.68005OpenAlexW4230306965MaRDI QIDQ5287534FDOQ5287534

Authors: Gregory J. Chaitin 

Publication date: 9 July 1993

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

Recommendations

• scientific article; zbMATH DE number 44959
• Algorithmic information theory
• Algorithmic Information Theory
• Information, randomness and incompleteness. Papers on algorithmic information theory

zbMATH Keywords

randomnessincompletenessalgorithmic information theoryHilbert's tenth problemhalting problems

Mathematics Subject Classification ID

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

Cited In (11)

• Infinite Divisibility of Information
• Title not available (Why is that?)
• Information-theoretic characterizations of recursive infinite strings
• COMPLEXITY, INFORMATION, ENERGY
• Incomplete information: Structure, inference, complexity
• Title not available (Why is that?)
• LISP program-size complexity. II
• Incompleteness and the halting problem
• Incomplete information and fractal phase space
• God's number: Where can we find the secret of the universe? In a single number!
• Algorithmic Information Theory

This page was built for publication: Information-Theoretic Incompleteness

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