DROPS

Document

DOI: 10.4230/LIPIcs.STACS.2022.11

Probabilistic vs Deterministic Gamblers

Authors: Laurent Bienvenu, Valentino Delle Rose, and Tomasz Steifer

Published in: LIPIcs, Volume 219, 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)

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.

Cite as

Laurent Bienvenu, Valentino Delle Rose, and Tomasz Steifer. Probabilistic vs Deterministic Gamblers. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 11:1-11:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)

Copy BibTex To Clipboard

@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/entities/document/10.4230/LIPIcs.STACS.2022.11},
  URN =		{urn:nbn:de:0030-drops-158210},
  doi =		{10.4230/LIPIcs.STACS.2022.11},
  annote =	{Keywords: Algorithmic randomness, Martingales, Probabilistic computation, Almost everywhere domination}
}

Search Results

Documents authored by Delle Rose, Valentino

Probabilistic vs Deterministic Gamblers

Abstract

Cite as

Thanks for your feedback!

Could not send message