Brattka, Vasco ;
Gherardi, Guido ;
Hölzl, Rupert
Las Vegas Computability and Algorithmic Randomness
Abstract
In this article we try to formalize the question "What can be computed with access to randomness?" We propose the very fine-grained Weihrauch lattice as an approach to differentiate between different types of computation with access to randomness. In particular, we show that a natural concept of Las Vegas computability on infinite objects is more powerful than mere oracle access to a Martin-Löf random object. As a concrete problem that is Las Vegas computable but not computable with access to a Martin-Löf random oracle we study the problem of finding Nash equilibria.
BibTeX - Entry
@InProceedings{brattka_et_al:LIPIcs:2015:4909,
author = {Vasco Brattka and Guido Gherardi and Rupert H{\"o}lzl},
title = {{Las Vegas Computability and Algorithmic Randomness}},
booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)},
pages = {130--142},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-78-1},
ISSN = {1868-8969},
year = {2015},
volume = {30},
editor = {Ernst W. Mayr and Nicolas Ollinger},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2015/4909},
URN = {urn:nbn:de:0030-drops-49093},
doi = {10.4230/LIPIcs.STACS.2015.130},
annote = {Keywords: Weihrauch degrees, weak weak K{\"o}nig's lemma, Las Vegas computability, algorithmic randomness, Nash equilibria}
}
|
Keywords: |
|
Weihrauch degrees, weak weak König's lemma, Las Vegas computability, algorithmic randomness, Nash equilibria |
|
Seminar: |
|
32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)
|
|
Issue date: |
|
2015 |
|
Date of publication: |
|
2015 |
2015
