Notions of robust information coding

DOI10.3233/COM-160059zbMath1420.03096arXiv1406.2982MaRDI QIDQ5283443

Damir D. Dzhafarov, Gregory Igusa

Publication date: 21 July 2017

Published in: Computability (Search for Journal in Brave)

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

zbMATH Keywords

coarse computabilitygeneric case complexitygeneric computability

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (6)

On notions of computability-theoretic reduction between Π21 principles ⋮ THE COMPUTATIONAL CONTENT OF INTRINSIC DENSITY ⋮ A MINIMAL PAIR IN THE GENERIC DEGREES ⋮ DENSITY-1-BOUNDING AND QUASIMINIMALITY IN THE GENERIC DEGREES ⋮ Asymptotic Density and the Theory of Computability: A Partial Survey ⋮ Asymptotic density and computability

Cites Work

• Unnamed Item
• Generic computability, Turing degrees, and asymptotic density
• Nonexistence of minimal pairs for generic computability
• ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS
• Cohesive avoidance and strong reductions

This page was built for publication: Notions of robust information coding