Most sequences are stochastic

DOI10.1006/inco.2001.3041zbMath1007.68080OpenAlexW2006653634MaRDI QIDQ1854454

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.1006/inco.2001.3041

Mathematics Subject Classification ID

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

Related Items (1)

On complexity of easy predictable sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Nonstochastic estimates
• A game of prediction with expert advice
• Non-stochastic infinite and finite sequences
• Computational learning theory. 2nd European Conference, EuroCOLT '95, Barcelona, Spain, March 13-15, 1995. Proceedings
• Suboptimal measures of predictive complexity for absolute loss function
• Randomness conservation inequalities; information and independence in mathematical theories
• On the Defect of Randomness of a Finite Object with Respect to Measures with Given Complexity Bounds
• 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: Most sequences are stochastic