How many strings are easy to predict?

DOI10.1016/j.ic.2005.04.001zbMath1101.68046OpenAlexW1980430237WikidataQ62046746 ScholiaQ62046746MaRDI QIDQ2566221

Michael V. Vyugin, Yuri Kalnishkan, Vladimir Vovk

Publication date: 22 September 2005

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2005.04.001

zbMATH Keywords

Kolmogorov complexity

Mathematics Subject Classification ID

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

Related Items (2)

Generalised entropies and asymptotic complexities of languages ⋮ Predictive Complexity for Games with Finite Outcome Spaces

Cites Work

• The weighted majority algorithm
• Probability with Martingales
• How to use expert advice
• Sequential prediction of individual sequences under general loss functions
• Probability Inequalities for Sums of Bounded Random Variables
• Algorithmic Learning Theory
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: How many strings are easy to predict?