Las Vegas computability and algorithmic randomness

DOI10.4230/LIPICS.STACS.2015.130MaRDI QIDQ2954989zbMATH OpenOpenAlexFDO

Authors Vasco Brattka, Guido Gherardi, Rupert Hölzl

Publication date 24 January 2017

Full work available at URL https://doi.org/10.4230/LIPIcs.STACS.2015.130

zbMATH Keywords

algorithmic randomnessLas Vegas computabilityNash equilibriaweak weak König's lemmaWeihrauch degrees

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Noncooperative games (91A10)

Recommendations

• Probabilistic computability and choice
• Computability and randomness of Nash equilibrium in infinite games
• Monte Carlo computability
• scientific article; zbMATH DE number 1531917
• Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations

Cited in

(7)

• On the uniform computational content of computability theory
• Probabilistic computability and choice
• Universality, optimality, and randomness deficiency
• The Vitali Covering Theorem in the Weihrauch Lattice
• Monte Carlo computability
• Computable Measure Theory and Algorithmic Randomness
• Randomness notions and reverse mathematics

This page was built for publication: Las Vegas computability and algorithmic randomness

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