The computable Lipschitz degrees of computably enumerable sets are not dense

DOI10.1016/j.apal.2010.06.008zbMath1225.03051OpenAlexW2162720511MaRDI QIDQ636391

Adam R. Day

Publication date: 26 August 2011

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2010.06.008

zbMATH Keywords

algorithmic information theorydensitycomputably enumerable setscomputable Lipschitz degreesSolovay degrees

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Algorithmic randomness and dimension (03D32)

Related Items (4)

Where join preservation fails in the bounded Turing degrees of c.e. sets ⋮ Maximal pairs of computably enumerable sets in the computably Lipschitz degrees ⋮ On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets ⋮ Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A c.e. real that cannot be sw-computed by any \(\Omega\) number
• Randomness and reducibility
• The ibT degrees of computably enumerable sets are not dense
• The recursively enumerable degrees are dense
• Algorithmic Randomness and Complexity
• Computability Results Used in Differential Geometry
• Random reals and Lipschitz continuity
• The weak truth table degrees of recursively enumerable sets
• There is no SW-complete c.e. real
• New Computational Paradigms

This page was built for publication: The computable Lipschitz degrees of computably enumerable sets are not dense