Does snooping help?

DOI10.1016/S0304-3975(01)00122-0zbMath1002.68072MaRDI QIDQ1605319

Vladimir V. V'yugin

Publication date: 15 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Kolmogorov complexitycomputer learningcomputer predictionsnooping

Mathematics Subject Classification ID

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

Related Items (3)

Algorithmic Statistics: Forty Years Later ⋮ Predictive complexity and information ⋮ Algorithmic Statistics Revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Kolmogorov's contributions to information theory and algorithmic complexity
• A game of prediction with expert advice
• On the Defect of Randomness of a Finite Object with Respect to Measures with Given Complexity Bounds
• Sequential prediction of individual sequences under general loss functions
• Algorithmic Complexity and Stochastic Properties of Finite Binary Sequences
• Complexity Approximation Principle

This page was built for publication: Does snooping help?