Dense computability, upper cones, and minimal pairs
From MaRDI portal
Publication:5211058
DOI10.3233/COM-180231zbMath1454.03052arXiv1811.07172OpenAlexW2962921822WikidataQ127853394 ScholiaQ127853394MaRDI QIDQ5211058
Eric P. Astor, Denis R. Hirschfeldt, Carl G. jun. Jockusch
Publication date: 17 January 2020
Published in: Computability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.07172
asymptotic densitycoarse computabilityquasiminimalityreducibilitiesgeneric computabilitydense computability
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Other Turing degree structures (03D28)
Related Items
THE COMPUTATIONAL CONTENT OF INTRINSIC DENSITY ⋮ A MINIMAL PAIR IN THE GENERIC DEGREES ⋮ INTRINSIC SMALLNESS ⋮ Asymptotic density and computability
This page was built for publication: Dense computability, upper cones, and minimal pairs