Kolmogorov Structure Functions for Automatic Complexity in Computational Statistics

DOI10.1007/978-3-319-12691-3_49zbMath1332.68096arXiv1409.0584OpenAlexW2166270008MaRDI QIDQ2942440

Bjørn Kjos-Hanssen

Publication date: 11 September 2015

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (2)

Kolmogorov Structure Functions for Automatic Complexity in Computational Statistics ⋮ Effectively closed sets of measures and randomness

Cites Work

• Unnamed Item
• The Kolmogorov complexity of infinite words
• Nondeterministic Automatic Complexity of Almost Square-Free and Strongly Cube-Free Words
• Kolmogorov Structure Functions for Automatic Complexity in Computational Statistics
• The Longest Run of Heads
• Kolmogorov's Structure Functions and Model Selection

This page was built for publication: Kolmogorov Structure Functions for Automatic Complexity in Computational Statistics