Probabilistic vs deterministic gamblers
From MaRDI portal
Publication:6385151
DOI10.4230/LIPICS.STACS.2022.11arXiv2112.04460OpenAlexW4297142679MaRDI QIDQ6385151FDOQ6385151
Authors: Laurent Bienvenu, Rose Valentino Delle, Tomasz Steifer 
Publication date: 8 December 2021
Abstract: Can a probabilistic gambler get arbitrarily rich when all deterministic gamblers fail? We study this problem in the context of algorithmic randomness, introducing a new notion -- almost everywhere computable randomness. A binary sequence is a.e. computably random if there is no probabilistic computable strategy which is total and succeeds on for positive measure of oracles. Using the fireworks technique we construct a sequence which is partial computably random but not a.e. computably random. We also prove the separation between a.e. computable randomness and partial computable randomness, which happens exactly in the uniformly almost everywhere dominating Turing degrees.
Full work available at URL: https://hal.science/hal-03788054
This page was built for publication: Probabilistic vs deterministic gamblers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6385151)
