On complexity of easy predictable sequences

DOI10.1016/S0890-5401(02)93164-0zbMath1012.68090OpenAlexW1964796174MaRDI QIDQ1854565

Michael V. Vyugin, Vladimir V. V'yugin

Publication date: 14 January 2003

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

Full work available at URL: https://doi.org/10.1016/s0890-5401(02)93164-0

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (2)

Predictive complexity and information ⋮ Predictive Complexity for Games with Finite Outcome Spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A game of prediction with expert advice
• Most sequences are stochastic
• How to use expert advice
• Complexity Approximation Principle
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS

This page was built for publication: On complexity of easy predictable sequences