License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2022.11
URN: urn:nbn:de:0030-drops-158210
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2022/15821/
Go to the corresponding LIPIcs Volume Portal

Bienvenu, Laurent ; Delle Rose, Valentino ; Steifer, Tomasz

Probabilistic vs Deterministic Gamblers

pdf-format:
LIPIcs-STACS-2022-11.pdf (0.6 MB)

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 X is a.e. computably random if there is no probabilistic computable strategy which is total and succeeds on X 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.

BibTeX - Entry

@InProceedings{bienvenu_et_al:LIPIcs.STACS.2022.11,
  author =	{Bienvenu, Laurent and Delle Rose, Valentino and Steifer, Tomasz},
  title =	{{Probabilistic vs Deterministic Gamblers}},
  booktitle =	{39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)},
  pages =	{11:1--11:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-222-8},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{219},
  editor =	{Berenbrink, Petra and Monmege, Benjamin},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2022/15821},
  URN =		{urn:nbn:de:0030-drops-158210},
  doi =		{10.4230/LIPIcs.STACS.2022.11},
  annote =	{Keywords: Algorithmic randomness, Martingales, Probabilistic computation, Almost everywhere domination}
}

Keywords: Algorithmic randomness, Martingales, Probabilistic computation, Almost everywhere domination
Collection: 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)
Issue Date: 2022
Date of publication: 09.03.2022

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI