A MINIMAL PAIR IN THE GENERIC DEGREES

DOI10.1017/jsl.2019.77zbMath1452.03094arXiv1910.05825OpenAlexW3102149946MaRDI QIDQ5107242

Denis R. Hirschfeldt

Publication date: 17 April 2020

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

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

zbMATH Keywords

minimal pairsgeneric computabilitygeneric reducibility

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (2)

Computing sets from all infinite subsets ⋮ Asymptotic density and computability

Cites Work

• Approximations to the halting problem
• Generic-case complexity, decision problems in group theory, and random walks.
• THE GENERIC DEGREES OF DENSITY-1 SETS, AND A CHARACTERIZATION OF THE HYPERARITHMETIC REALS
• Generic computability, Turing degrees, and asymptotic density
• Asymptotic Density and the Theory of Computability: A Partial Survey
• Some Questions in Computable Mathematics
• COARSE REDUCIBILITY AND ALGORITHMIC RANDOMNESS
• Algorithmic Randomness and Complexity
• Arithmetical Measure
• Dense computability, upper cones, and minimal pairs
• Notions of robust information coding
• Nonexistence of minimal pairs for generic computability
• ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS

This page was built for publication: A MINIMAL PAIR IN THE GENERIC DEGREES