Notions of robust information coding
From MaRDI portal
Publication:5283443
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
03B30: Foundations of classical theories (including reverse mathematics)
03D25: Recursively (computably) enumerable sets and degrees
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
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 computability, Asymptotic Density and the Theory of Computability: A Partial Survey, On notions of computability-theoretic reduction between Π21 principles
Cites Work