Discussion on Kolmogorov Complexity and Statistical Analysis
From MaRDI portal
Publication:4942696
DOI10.1093/comjnl/42.4.340zbMath0946.68063OpenAlexW2147923459MaRDI QIDQ4942696
Publication date: 14 March 2000
Published in: The Computer Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/comjnl/42.4.340
Related Items
Algorithmic minimal sufficient statistics: a new approach, The Kolmogorov birthday paradox, Kolmogorov's Last Discovery? (Kolmogorov and Algorithmic Statistics), Algorithmic Statistics: Forty Years Later, An extended coding theorem with application to quantum complexities, Algorithmic Minimal Sufficient Statistic Revisited, Kolmogorov Complexity and Model Selection