Monte Carlo Computability
From MaRDI portal
Publication:4636615
DOI10.4230/LIPICS.STACS.2017.17zbMath1402.03068OpenAlexW2604679651MaRDI QIDQ4636615
Vasco Brattka, Rupert Hölzl, Rutger Kuyper
Publication date: 19 April 2018
Full work available at URL: https://doi.org/10.4230/LIPIcs.STACS.2017.17
Searching and sorting (68P10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Turing machines and related notions (03D10) Algorithmic randomness and dimension (03D32) Computation over the reals, computable analysis (03D78)
Related Items (4)
Algebraic properties of the first-order part of a problem ⋮ Completion of choice ⋮ FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS ⋮ Weihrauch Complexity in Computable Analysis
This page was built for publication: Monte Carlo Computability
