INTRINSIC SMALLNESS

DOI10.1017/jsl.2020.39OpenAlexW2972026450MaRDI QIDQ5159488

Justin Miller

Publication date: 27 October 2021

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

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

zbMATH Keywords

intrinsic computabilityhyperimmunityintrinsic densityasymptotic computationweakly computably traceable

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Upward closure and cohesive degrees
• Generic-case complexity, decision problems in group theory, and random walks.
• On the degrees less than 0'
• Turing Computability
• Generic computability, Turing degrees, and asymptotic density
• Kolmogorov complexity and the Recursion Theorem
• Algorithmic Randomness and Complexity
• Asymptotic density, immunity and randomness
• THE COMPUTATIONAL CONTENT OF INTRINSIC DENSITY
• Dense computability, upper cones, and minimal pairs
• ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS

This page was built for publication: INTRINSIC SMALLNESS