Monte Carlo computability

DOI10.4230/LIPICS.STACS.2017.17zbMATH Open1402.03068OpenAlexW2604679651MaRDI QIDQ4636615FDOQ4636615

Authors: 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

Recommendations

• Probabilistic computability and choice
• Las Vegas computability and algorithmic randomness
• On the Monte Carlo space constructible functions and separation results for probabilistic complexity classes
• scientific article; zbMATH DE number 3878357
• scientific article; zbMATH DE number 4091486

zbMATH Keywords

sortingalgorithmic randomnessWeihrauch degreesMonte Carlo computabilityweak weak Kőnig's lemma

Mathematics Subject Classification ID

Searching and sorting (68P10) Algorithmic randomness and dimension (03D32) Computation over the reals, computable analysis (03D78) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Turing machines and related notions (03D10)

Cited In (8)

• Completion of choice
• Monotone Emulation of Computer Experiments
• Algebraic properties of the first-order part of a problem
• FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS
• Monte Carlo tableau proof search
• Title not available (Why is that?)
• Weihrauch Complexity in Computable Analysis
• Title not available (Why is that?)

This page was built for publication: Monte Carlo computability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4636615)