Complexity Approximation Principle

DOI10.1093/comjnl/42.4.318zbMath0937.68063OpenAlexW1972887468MaRDI QIDQ4933950

Alexander Gammerman, Vladimir Vovk

Publication date: 17 January 2000

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/4a8a8a5dfe48874f05ad9cc2f06a4a2f0da13099

zbMATH Keywords

Kolmogorov complexityminimum description lengthminimum message lengthcomplexity approximation principle

Mathematics Subject Classification ID

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

Related Items (7)

Competitive On-line Statistics ⋮ Predictive complexity and information ⋮ General linear relations between different types of predictive complexity ⋮ Most sequences are stochastic ⋮ Suboptimal measures of predictive complexity for absolute loss function ⋮ On complexity of easy predictable sequences ⋮ Does snooping help?

This page was built for publication: Complexity Approximation Principle