A new version of algorithmic information theory.

DOI10.1002/CPLX.6130010410MaRDI QIDQ960451zbMATH OpenOpenAlexFDO

Authors Gregory J. Chaitin

Publication date 21 December 2008

Published in Complexity (Search for Journal in Brave)

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

zbMATH Keywords

algorithmic information theoryinformation-theoretic incompleteness theorems

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Information theory (general) (94A15)

Abstract: This material was presented in a series of lectures at the Santa Fe Institute, the Los Alamos National Laboratory, and the University of New Mexico, during a one-month visit to the Santa Fe Institute, April 1995.

Review text

Summary: We present a much more concrete version of algorithmic information theory in which one can actually run on a computer the algorithms in the proofs of a number of key information-theoretic incompleteness theorems.

Recommendations

• scientific article; zbMATH DE number 1222084
• Information, randomness and incompleteness. Papers on algorithmic information theory
• scientific article; zbMATH DE number 1418478
• A glimpse into algorithmic information theory
• Algorithmic Information Theory

Cited in

(4)

• Toward an algorithmic metaphysics
• Game arguments in computability theory and algorithmic information theory
• scientific article; zbMATH DE number 5081004 (Why is no real title available?)
• Links between physics and set theory.

This page was built for publication: A new version of algorithmic information theory.

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