"Two betting strategies that predict all compressible sequences" presentation
Tomislav Petrovi\'c
TL;DR
This presentation introduces two betting strategies capable of predicting all sequences that are compressible, advancing understanding in the field of algorithmic randomness and sequence prediction.
Contribution
The paper presents two novel betting strategies that can predict all compressible sequences, contributing new methods to the study of sequence prediction and randomness.
Findings
Successfully predicts all compressible sequences.
Provides theoretical foundations for betting strategies.
Enhances understanding of sequence compressibility.
Abstract
Presentation for a talk "Two betting strategies that predict all compressible sequences" given at Seventh International Conference on Computability, Complexity and Randomness (CCR 2012) http://www.newton.ac.uk/programmes/SAS/seminars/070217001.html
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSports Analytics and Performance · Numerical Methods and Algorithms · Spreadsheets and End-User Computing