A new version of algorithmic information theory.

DOI10.1002/CPLX.6130010410zbMATH Open1455.68074arXivchao-dyn/9506003OpenAlexW2135939243MaRDI QIDQ960451FDOQ960451

Authors: Gregory J. Chaitin 

Publication date: 21 December 2008

Published in: Complexity (Search for Journal in Brave)

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.

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

Recommendations

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

zbMATH Keywords

algorithmic information theoryinformation-theoretic incompleteness theorems

Mathematics Subject Classification ID

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

Cited In (4)

• Title not available (Why is that?)
• Game arguments in computability theory and algorithmic information theory
• Toward an algorithmic metaphysics
• 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)