Monotonous betting strategies in warped casinos
From MaRDI portal
Publication:2304524
DOI10.1016/j.ic.2019.104480zbMath1435.91044arXiv1807.04635OpenAlexW2980387258WikidataQ127018064 ScholiaQ127018064MaRDI QIDQ2304524
Nan Fang, George Barmpalias, Andrew E. M. Lewis-Pye
Publication date: 12 March 2020
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.04635
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Probabilistic games; gambling (91A60)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A generalization of Chaitin's halting probability \(\Omega\) and halting self-similar sets
- A Kolmogorov complexity characterization of constructive Hausdorff dimension.
- The dimensions of individual strings and sequences
- Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
- Randomness, Computation and Mathematics
- On Schnorr and computable randomness, martingales, and machines
- Algorithmic Randomness and Complexity
- Von Mises' definition of random sequences reconsidered
- A Theory of Program Size Formally Identical to Information Theory
- What is a Martingale?
- A unified approach to the definition of random sequences
This page was built for publication: Monotonous betting strategies in warped casinos