Algorithmic Statistics: Normal Objects and Universal Models

DOI10.1007/978-3-319-34171-2_20zbMath1475.68141arXiv1512.04510OpenAlexW2276613127MaRDI QIDQ5740192

Alexey Milovanov

Publication date: 25 July 2016

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

denoisingminimum description lengthsufficient statisticalgorithmic statisticsstochastic stringstotal conditional complexity

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Statistical aspects of information-theoretic topics (62B10)

Related Items (1)

Algorithmic Statistics: Forty Years Later

Cites Work

• On the Turing completeness of the semantic web
• Game Arguments in Computability Theory and Algorithmic Information Theory
• Kolmogorov's Structure Functions and Model Selection
• Algorithmic statistics
• An introduction to Kolmogorov complexity and its applications
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithmic Statistics: Normal Objects and Universal Models