Asymptotic density and the Ershov hierarchy

DOI10.1002/malq.201300081zbMath1361.03037arXiv1309.0137OpenAlexW2147273418MaRDI QIDQ5258480

Timothy H. McNicholl, Carl G. jun. Jockusch, Paul E. Schupp, Rodney G. Downey

Publication date: 22 June 2015

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1309.0137

zbMATH Keywords

asymptotic densityErshov hierarchy

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Hierarchies of computability and definability (03D55)

Related Items (8)

Generically and coarsely computable isomorphisms ⋮ Asymptotic density, immunity and randomness ⋮ THE COMPUTATIONAL CONTENT OF INTRINSIC DENSITY ⋮ Asymptotic Density and the Theory of Computability: A Partial Survey ⋮ Some Questions in Computable Mathematics ⋮ Asymptotic density and the coarse computability bound ⋮ Generic case completeness ⋮ Asymptotic density and computability

Cites Work

• Cohesive sets and recursively enumerable Dedekind cuts
• On a hierarchy of sets. III
• Generic computability, Turing degrees, and asymptotic density
• Algorithmic Randomness and Complexity
• ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS
• Weakly computable real numbers

This page was built for publication: Asymptotic density and the Ershov hierarchy