An invitation to algorithmic information theory

MaRDI QIDQ4217578zbMATH OpenFDO

Authors Gregory J. Chaitin

Publication date 11 November 1998

Full work available at URL https://arxiv.org/abs/chao-dyn/9609008

zbMATH Keywords

algorithmic information theory

Mathematics Subject Classification ID

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

Recommendations

• A glimpse into algorithmic information theory
• scientific article; zbMATH DE number 5252406
• scientific article; zbMATH DE number 5919713
• scientific article; zbMATH DE number 1216200
• Algorithmic Information Theory
• Algorithmic information theory
• scientific article; zbMATH DE number 1542863

Cited in

(12)

• Some issues in the theory of optimal algorithms and informational complexity
• Mathematics as information compression via the matching and unification of patterns
• scientific article; zbMATH DE number 6019536 (Why is no real title available?)
• scientific article; zbMATH DE number 4047567 (Why is no real title available?)
• scientific article; zbMATH DE number 736618 (Why is no real title available?)
• The limits of mathematics. A course on information theory and the limits of formal reasoning. With a foreword by Cristian Calude
• scientific article; zbMATH DE number 2040936 (Why is no real title available?)
• A theory of information with special application to search problems
• scientific article; zbMATH DE number 1875872 (Why is no real title available?)
• scientific article; zbMATH DE number 1911266 (Why is no real title available?)
• Algorithmic information theory: Open problems
• A new version of algorithmic information theory.

This page was built for publication: An invitation to algorithmic information theory

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