Algorithmic information theory

DOI10.2307/2274821MaRDI QIDQ3197800zbMATH OpenOpenAlexFDO

Authors Michiel van Lambalgen

Publication date 1989

Published in 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

Chaitin's incompleteness theoremchaos theoryGödel's first incompleteness theoreminformation contentKolmogorov complexityr.e. setsrandomnessthermodynamics

Mathematics Subject Classification ID

Philosophy of mathematics (00A30) Philosophical and critical aspects of logic and foundations (03A05) Recursively (computably) enumerable sets and degrees (03D25) Proof theory in general (including proof-theoretic semantics) (03F03) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Information theory (general) (94A15)

Recommendations

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

Cited in

(27)

• Incompleteness theorems for random reals
• On interpreting Chaitin's incompleteness theorem
• On constructivity and the Rosser property: a closer look at some Gödelean proofs
• Gödel's theorem and information
• 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'
• Information, randomness and incompleteness. Papers on algorithmic information theory
• Abstract Chaitin's theorem and its methodological consequences
• Game arguments in computability theory and algorithmic information theory
• Kolmogorov complexity and characteristic constants of formal theories of arithmetic
• scientific article; zbMATH DE number 1820020 (Why is no real title available?)
• scientific article; zbMATH DE number 5081004 (Why is no real title available?)
• On Characteristic Constants of Theories Defined by Kolmogorov Complexity
• scientific article; zbMATH DE number 53549 (Why is no real title available?)
• scientific article; zbMATH DE number 1222084 (Why is no real title available?)
• The Source of Chaitin's Incorrectness
• scientific article; zbMATH DE number 1418484 (Why is no real title available?)
• INFORMATION IN PROPOSITIONAL PROOFS AND ALGORITHMIC PROOF SEARCH
• Kolmogorov complexity in perspective. I: Information theory and randomness
• Information-Theoretic Incompleteness
• Observation of Unbounded Novelty in Evolutionary Algorithms is Unknowable
• Theory and Applications of Models of Computation
• Information Algebra
• Algorithmic information theory and undecidability
• Models and the dynamics of theory-building in physics. I: Modeling strategies

This page was built for publication: Algorithmic information theory

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