Asymptotic density, computable traceability, and 1-randomness
DOI10.4064/FM118-10-2015zbMATH Open1401.03074OpenAlexW2484482943MaRDI QIDQ3178221FDOQ3178221
Authors: Uri Andrews, Mingzhong Cai, Carl G. jun. Jockusch, Steffen Lempp, David Diamondstone 
Publication date: 8 July 2016
Published in: Fundamenta Mathematicae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4064/fm118-10-2015
Recommendations
Algorithmic randomness and dimension (03D32) Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28)
Cites Work
- Algorithmic randomness and complexity.
- Computational randomness and lowness
- Generic complexity of undecidable problems
- Title not available (Why is that?)
- The Degrees of Hyperimmune Sets
- Generic-case complexity, decision problems in group theory, and random walks.
- Generic computability, Turing degrees, and asymptotic density
- ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS
- Notions of weak genericity
- Asymptotic density and the coarse computability bound
- A unifying approach to the Gamma question
- From bi-immunity to absolute undecidability
- Covering the Recursive Sets
Cited In (9)
- Some Questions in Computable Mathematics
- Asymptotic density and the coarse computability bound
- Lowness, Randomness, and Computable Analysis
- Asymptotic density and the theory of computability: a partial survey
- Asymptotic density and computability
- Characterizing the strongly jump-traceable sets via randomness
- Muchnik degrees and cardinal characteristics
- Coarse reducibility and algorithmic randomness
- The gamma question for many-one degrees
This page was built for publication: Asymptotic density, computable traceability, and 1-randomness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3178221)
