Algorithmic information theory

DOI10.2307/2274821zbMath0713.03001MaRDI QIDQ3197800

Michiel Marian Michiel van Lambalgen

Publication date: 1989

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: http://dare.uva.nl/personal/pure/en/publications/algorithmic-information-theory(3d79c1da-640d-478d-b057-17f56bc2892b).html

zbMATH Keywords

thermodynamics; Kolmogorov complexity; Gödel's first incompleteness theorem; chaos theory; randomness; information content; r.e. sets; Chaitin's incompleteness theorem

Mathematics Subject Classification ID

00A30: Philosophy of mathematics

03A05: Philosophical and critical aspects of logic and foundations

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

94A15: Information theory (general)

03D25: Recursively (computably) enumerable sets and degrees

03F03: Proof theory in general (including proof-theoretic semantics)

Related Items

INFORMATION IN PROPOSITIONAL PROOFS AND ALGORITHMIC PROOF SEARCH, Kolmogorov Complexity in Perspective Part I: Information Theory and Randomness, Observation of Unbounded Novelty in Evolutionary Algorithms is Unknowable, Models and the dynamics of theory-building in physics. I: Modeling strategies, On interpreting Chaitin's incompleteness theorem, On constructivity and the Rosser property: a closer look at some Gödelean proofs, Revisiting Chaitin's incompleteness theorem, The scope of Gödel's first incompleteness theorem, Is complexity a source of incompleteness?, On explicating the concept `the power of an arithmetical theory', Kolmogorov complexity and characteristic constants of formal theories of arithmetic, On Characteristic Constants of Theories Defined by Kolmogorov Complexity