Lowness for integer-valued randomness

DOI10.3233/COM-150045MaRDI QIDQ5740203zbMATH OpenOpenAlexFDO

Authors Ian Herbert

Publication date 25 July 2016

Published in Computability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1410.3211

zbMATH Keywords

algorithmic randomnessinteger-valued martingaleslowness

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Abstract: A real is called integer-valued random if no integer-valued martingale can win arbitrarily much capital betting against it. A real is low for integer-valued randomness if no integer-valued martingale recursive in A can succeed on an integer-valued random real. We show that lowness for integer-valued randomness coincides with recursiveness, as is the case for computable randomness.

Recommendations

• Integer valued betting strategies and Turing degrees
• Lowness properties and randomness
• Effective martingales with restricted wagers

Cites work

• A unified approach to the definition of random sequences
• Integer valued betting strategies and Turing degrees
• Lowness for the Class of Schnorr Random Reals
• Lowness properties and randomness

Cited in

(4)

• Granularity of wagers in games and the possibility of saving
• Characterizing lowness for Demuth randomness
• Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers
• Randomness of Low-Order Bits in Random Number Generators

This page was built for publication: Lowness for integer-valued randomness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5740203)