A Unifying Approach to the Gamma Question

DOI10.1109/LICS.2015.60zbMath1395.03019OpenAlexW1592218205MaRDI QIDQ4635838

Benoit Monin, André Nies

Publication date: 23 April 2018

Published in: 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/lics.2015.60

Mathematics Subject Classification ID

Other Turing degree structures (03D28) Algorithmic randomness and dimension (03D32)

Related Items (8)

Asymptotic density, computable traceability, and 1-randomness ⋮ Asymptotic Density and the Theory of Computability: A Partial Survey ⋮ Lowness, Randomness, and Computable Analysis ⋮ Some Questions in Computable Mathematics ⋮ MUCHNIK DEGREES AND CARDINAL CHARACTERISTICS ⋮ The gamma question for many-one degrees ⋮ Asymptotic density and computability ⋮ Martin-Löf random quantum states

This page was built for publication: A Unifying Approach to the Gamma Question