Las Vegas Computability and Algorithmic Randomness

DOI10.4230/LIPICS.STACS.2015.130zbMath1355.68132OpenAlexW2243383604MaRDI QIDQ2954989

Rupert Hölzl, Guido Gherardi, Vasco Brattka

Publication date: 24 January 2017

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

zbMATH Keywords

Nash equilibriaalgorithmic randomnessweak weak König's lemmaWeihrauch degreesLas Vegas computability

Mathematics Subject Classification ID

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

Related Items (5)

RANDOMNESS NOTIONS AND REVERSE MATHEMATICS ⋮ On the uniform computational content of computability theory ⋮ The Vitali Covering Theorem in the Weihrauch Lattice ⋮ Computable Measure Theory and Algorithmic Randomness ⋮ Universality, optimality, and randomness deficiency

This page was built for publication: Las Vegas Computability and Algorithmic Randomness