Algorithmic Statistics Revisited

DOI10.1007/978-3-319-21852-6_17zbMath1336.62036arXiv1504.04950OpenAlexW1589181118WikidataQ57349389 ScholiaQ57349389MaRDI QIDQ2805729

Alexander Shen, Nikolai K. Vereshchagin

Publication date: 13 May 2016

Published in: Measures of Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.04950

Mathematics Subject Classification ID

Foundations and philosophical topics in statistics (62A01) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Statistical aspects of information-theoretic topics (62B10)

Related Items

Randomness Tests: Theory and Practice ⋮ Inequalities for space-bounded Kolmogorov complexity ⋮ Kolmogorov's Last Discovery? (Kolmogorov and Algorithmic Statistics) ⋮ Algorithmic Statistics: Forty Years Later ⋮ Sophistication vs logical depth

Cites Work

• Unnamed Item
• Stability of properties of Kolmogorov complexity under relativization
• A universal prior for integers and estimation by minimum description length
• Nonstochastic estimates
• Mathematical metaphysics of randomness
• Inequalities for Shannon entropy and Kolmogorov complexity
• Does snooping help?
• Computational depth: Concept and applications
• Kolmogorov's Structure Functions and Model Selection
• Algorithmic Minimal Sufficient Statistic Revisited
• Randomness conservation inequalities; information and independence in mathematical theories
• Algorithmic Information Theory
• Rate Distortion and Denoising of Individual Data Using Kolmogorov Complexity
• An introduction to Kolmogorov complexity and its applications
• Combinatorial interpretation of Kolmogorov complexity