INTRINSIC SMALLNESS

DOI10.1017/JSL.2020.39OpenAlexW2972026450MaRDI QIDQ5159488FDOQ5159488

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

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

zbMATH Keywords

intrinsic computabilityhyperimmunityintrinsic densityasymptotic computationweakly computably traceable

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• Small Spans in Scaled Dimension
• The smallest non-autograph
• Understanding the small object argument

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)