Philosophical issues in Kolmogorov complexity
From MaRDI portal
Publication:5204301
DOI10.1007/3-540-55719-9_59zbMATH Open1425.68149OpenAlexW1490933241MaRDI QIDQ5204301FDOQ5204301
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
Cites Work
- Title not available (Why is that?)
- Modeling by shortest data description
- Combinatorial foundations of information theory and the calculus of probabilities
- A theory of the learnable
- A variant of the Kolmogorov concept of complexity
- The unreasonable effectiveness of mathematics in the natural sciences. Richard courant lecture in mathematical sciences delivered at New York University, May 11, 1959
- Learning Simple Concepts under Simple Distributions
- Title not available (Why is that?)
- Complexity-based induction systems: Comparisons and convergence theorems
- Information-theoretic characterizations of recursive infinite strings
- Title not available (Why is that?)
- An information-theoretic method in combinatorial theory
- Title not available (Why is that?)
Cited In (1)
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)