Integer valued betting strategies and Turing degrees
From MaRDI portal
Publication:2353410
DOI10.1016/j.jcss.2015.05.001zbMath1321.03054arXiv1505.05298OpenAlexW1862873396MaRDI QIDQ2353410
Michael McInerney, George Barmpalias, Rodney G. Downey
Publication date: 13 July 2015
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.05298
Generalizations of martingales (60G48) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Probabilistic games; gambling (91A60) Algorithmic randomness and dimension (03D32)
Related Items (4)
Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers ⋮ Granularity of wagers in games and the possibility of saving ⋮ A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES ⋮ Lowness for integer-valued randomness
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How powerful are integer-valued martingales?
- Turing degrees of reals of positive effective packing dimension
- Minimal pairs in initial segments of the recursively enumerable degrees
- Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
- Automorphisms of the lattice of $\Pi _1^0$ classes; perfect thin classes and anc degrees
- Computational randomness and lowness
- Jump inversions inside effectively closed sets and applications to randomness
- Algorithmic Randomness and Complexity
- The definition of random sequences
- Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets
- A basis theorem for Π₁⁰ classes of positive measure and jump inversion for random reals
- Randomness, relativization and Turing degrees
This page was built for publication: Integer valued betting strategies and Turing degrees
