Kolmogorov-Loveland betting strategies lose the Betting game on open sets
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916643373842432 |
|---|---|
| author | Petrović, Tomislav |
| author_facet | Petrović, Tomislav |
| contents | Whether Kolmogorov-Loveland randomness (KLR) is the same as Martin-Löf randomness (MLR) is a major open problem in the study of algorithmic randomness. More general classes of betting strategies than Kolmogorov-Loveland ones have been studied in \cite{MMS, Rute, TP}. In each case it was proven that the class induces a notion of randomness equivalent to MLR. In all of those proofs, it was shown that the class contains a finite set of betting strategies such that for any given bound, when betting on a binary sequence contained in an effective open set of small enough measure, at least one of the betting strategies in the set earns capital larger than the bound. We show that the class of Kolmogorov-Loveland betting strategies does not have this property. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_19817 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Kolmogorov-Loveland betting strategies lose the Betting game on open sets Petrović, Tomislav Information Theory Computational Complexity Whether Kolmogorov-Loveland randomness (KLR) is the same as Martin-Löf randomness (MLR) is a major open problem in the study of algorithmic randomness. More general classes of betting strategies than Kolmogorov-Loveland ones have been studied in \cite{MMS, Rute, TP}. In each case it was proven that the class induces a notion of randomness equivalent to MLR. In all of those proofs, it was shown that the class contains a finite set of betting strategies such that for any given bound, when betting on a binary sequence contained in an effective open set of small enough measure, at least one of the betting strategies in the set earns capital larger than the bound. We show that the class of Kolmogorov-Loveland betting strategies does not have this property. |
| title | Kolmogorov-Loveland betting strategies lose the Betting game on open sets |
| topic | Information Theory Computational Complexity |
| url | https://arxiv.org/abs/2403.19817 |