Philosophical issues in Kolmogorov complexity

DOI10.1007/3-540-55719-9_59zbMath1425.68149OpenAlexW1490933241MaRDI QIDQ5204301

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)

Related Items (1)

A generalized characterization of algorithmic probability

Cites Work

• Modeling by shortest data description
• Information-theoretic characterizations of recursive infinite strings
• An information-theoretic method in combinatorial theory
• The unreasonable effectiveness of mathematics in the natural sciences. Richard courant lecture in mathematical sciences delivered at New York University, May 11, 1959
• A theory of the learnable
• Combinatorial foundations of information theory and the calculus of probabilities
• Learning Simple Concepts under Simple Distributions
• Complexity-based induction systems: Comparisons and convergence theorems
• A variant of the Kolmogorov concept of complexity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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