Philosophical issues in Kolmogorov complexity

DOI10.1007/3-540-55719-9_59MaRDI QIDQ5204301zbMATH OpenOpenAlexFDO

Authors Paul M. B. Vitányi, Ming Li

Publication date 4 December 2019

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://ir.cwi.nl/pub/1974

zbMATH Keywords

Kolmogorov complexity

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3499765 (Why is no real title available?)
• scientific article; zbMATH DE number 1010621 (Why is no real title available?)
• scientific article; zbMATH DE number 1142293 (Why is no real title available?)
• scientific article; zbMATH DE number 3194843 (Why is no real title available?)
• A theory of the learnable
• A variant of the Kolmogorov concept of complexity
• An information-theoretic method in combinatorial theory
• Combinatorial foundations of information theory and the calculus of probabilities
• Complexity-based induction systems: Comparisons and convergence theorems
• Information-theoretic characterizations of recursive infinite strings
• Learning Simple Concepts under Simple Distributions
• Modeling by shortest data description
• The unreasonable effectiveness of mathematics in the natural sciences. Richard courant lecture in mathematical sciences delivered at New York University, May 11, 1959

Cited in

(1)

• A generalized characterization of algorithmic probability

This page was built for publication: Philosophical issues in Kolmogorov complexity

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