Monte Carlo computability

DOI10.4230/LIPICS.STACS.2017.17MaRDI QIDQ4636615zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

algorithmic randomnessMonte Carlo computabilitysortingweak weak Kőnig's lemmaWeihrauch degrees

Mathematics Subject Classification ID

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

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

Cited in

(10)

• Completion of choice
• Probabilistic computability and choice
• Monte Carlo tableau proof search
• Monotone Emulation of Computer Experiments
• Las Vegas computability and algorithmic randomness
• scientific article; zbMATH DE number 3878357 (Why is no real title available?)
• scientific article; zbMATH DE number 4091486 (Why is no real title available?)
• Weihrauch Complexity in Computable Analysis
• FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS
• Algebraic properties of the first-order part of a problem

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)