Coarse computability, the density metric, Hausdorff distances between Turing degrees, perfect trees, and reverse mathematics

DOI10.1142/S0219061323500058arXiv2106.13118MaRDI QIDQ6371175

Carl G. jun. Jockusch, Paul E. Schupp, Denis R. Hirschfeldt

Publication date: 24 June 2021

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Ramsey theory (05D10) Recursively (computably) enumerable sets and degrees (03D25) Second- and higher-order arithmetic and fragments (03F35) Other Turing degree structures (03D28) Algorithmic randomness and dimension (03D32)

This page was built for publication: Coarse computability, the density metric, Hausdorff distances between Turing degrees, perfect trees, and reverse mathematics