THE COMPUTATIONAL CONTENT OF INTRINSIC DENSITY

DOI10.1017/jsl.2018.4zbMath1436.03223arXiv1708.04267OpenAlexW2963179791WikidataQ129430096 ScholiaQ129430096MaRDI QIDQ4579823

Eric P. Astor

Publication date: 10 August 2018

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

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

zbMATH Keywords

Turing degreeDNRdominatingintrinsic densitydiagonal non-computablereverse mathematic

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35) Other Turing degree structures (03D28)

Related Items (2)

INTRINSIC SMALLNESS ⋮ Fixed point theorems for precomplete numberings

Cites Work

• Unnamed Item
• Upward closure and cohesive degrees
• Generic-case complexity, decision problems in group theory, and random walks.
• Asymptotic density and the coarse computability bound
• Turing Computability
• Generic computability, Turing degrees, and asymptotic density
• Weakly Represented Families in Reverse Mathematics
• COARSE REDUCIBILITY AND ALGORITHMIC RANDOMNESS
• Kolmogorov complexity and the Recursion Theorem
• Algorithmic Randomness and Complexity
• Asymptotic density, immunity and randomness
• Randomness and Computability: Open Questions
• A cohesive set which is not high
• Dense computability, upper cones, and minimal pairs
• Asymptotic density and the Ershov hierarchy
• Notions of robust information coding
• Nonexistence of minimal pairs for generic computability
• ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• Randomness, relativization and Turing degrees

This page was built for publication: THE COMPUTATIONAL CONTENT OF INTRINSIC DENSITY