INTRINSIC SMALLNESS

DOI10.1017/JSL.2020.39MaRDI QIDQ5159488zbMATH OpenOpenAlexFDO

Authors Justin Miller

Publication date 27 October 2021

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

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

zbMATH Keywords

asymptotic computationhyperimmunityintrinsic computabilityintrinsic densityweakly computably traceable

Mathematics Subject Classification ID

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

Recommendations

• THE COMPUTATIONAL CONTENT OF INTRINSIC DENSITY
• Asymptotic density, immunity and randomness
• ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS
• Asymptotic density and computability
• Intermediate intrinsic density and randomness

Cites work

• Algorithmic randomness and complexity.
• ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS
• Asymptotic density, immunity and randomness
• Dense computability, upper cones, and minimal pairs
• Generic computability, Turing degrees, and asymptotic density
• Generic-case complexity, decision problems in group theory, and random walks.
• scientific article; zbMATH DE number 3827843 (Why is no real title available?)
• On the degrees less than 0'
• THE COMPUTATIONAL CONTENT OF INTRINSIC DENSITY
• Turing computability. Theory and applications
• Upward closure and cohesive degrees

Cited in

(5)

• Small Spans in Scaled Dimension
• Intermediate intrinsic density and randomness
• Understanding the small object argument
• Intrinsic Smallness
• The smallest non-autograph

This page was built for publication: INTRINSIC SMALLNESS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5159488)