Kolmogorov-Loveland betting strategies lose the Betting game on open sets
<|reference_start|>Kolmogorov-Loveland betting strategies lose the Betting game on open sets: If Kolmogorov-Loveland randomness (KLR) is the same as Martin-L\"of 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} and 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.<|reference_end|>
@article{petrović2024kolmogorov-loveland,
    title={Kolmogorov-Loveland betting strategies lose the Betting game on open
  sets},
    author={Tomislav Petrovi'c},
    journal={arXiv preprint arXiv:2403.19817},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.19817},
    primaryClass={cs.IT cs.CC math.IT}
}