The gamma question for many-one degrees
From MaRDI portal
Publication:526966
DOI10.1016/j.apal.2017.01.006zbMath1422.03089arXiv1606.05701OpenAlexW2963323082MaRDI QIDQ526966
Publication date: 15 May 2017
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.05701
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Other degrees and reducibilities in computability and recursion theory (03D30) Other Turing degree structures (03D28) Algorithmic randomness and dimension (03D32)
Related Items (3)
Probability modals and infinite domains ⋮ MUCHNIK DEGREES AND CARDINAL CHARACTERISTICS ⋮ Asymptotic density and computability
Cites Work
- The tail of the hypergeometric distribution
- Asymptotic density and the coarse computability bound
- Generic computability, Turing degrees, and asymptotic density
- Some Questions in Computable Mathematics
- Asymptotic density, computable traceability, and 1-randomness
- A Unifying Approach to the Gamma Question
- Probability Inequalities for Sums of Bounded Random Variables
- Unnamed Item
This page was built for publication: The gamma question for many-one degrees