Monte Carlo Computability
We introduce Monte Carlo computability as a probabilistic concept of computability on infinite objects and prove that Monte Carlo computable functions are closed under composition. We then mutually separate the following classes of functions from each other: the class of multi-valued functions that are non-deterministically computable, that of Las Vegas computable functions, and that of Monte Carlo computable functions. We give natural examples of computational problems witnessing these separations. As a specific problem which is Monte Carlo computable but neither Las Vegas computable nor non-deterministically computable, we study the problem of sorting infinite sequences that was recently introduced by Neumann and Pauly. Their results allow us to draw conclusions about the relation between algebraic models and Monte Carlo computability.
Weihrauch degrees
Weak Weak Konig's Lemma
Monte Carlo computability
algorithmic randomness
sorting
17:1-17:14
Regular Paper
Vasco
Brattka
Vasco Brattka
Rupert
Hölzl
Rupert Hölzl
Rutger
Kuyper
Rutger Kuyper
10.4230/LIPIcs.STACS.2017.17
Creative Commons Attribution 3.0 Unported license
https://creativecommons.org/licenses/by/3.0/legalcode