Algorithmic Minimal Sufficient Statistic Revisited

DOI10.1007/978-3-642-03073-4_49zbMath1268.68089OpenAlexW2100925002MaRDI QIDQ3576086

Nikolai K. Vereshchagin

Publication date: 28 July 2010

Published in: Mathematical Theory and Computational Practice (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03073-4_49

Mathematics Subject Classification ID

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

Related Items (5)

Algorithmic minimal sufficient statistics: a new approach ⋮ Algorithmic Statistics: Forty Years Later ⋮ Sophistication vs logical depth ⋮ Algorithmic Statistics Revisited ⋮ On Approximate Decidability of Minimal Programs

Cites Work

• Unnamed Item
• Kolmogorov's Structure Functions and Model Selection
• Algorithmic statistics
• Discussion on Kolmogorov Complexity and Statistical Analysis

This page was built for publication: Algorithmic Minimal Sufficient Statistic Revisited