Maximal pairs of c.e. reals in the computably Lipschitz degrees

DOI10.1016/j.apal.2010.10.003zbMath1252.03102OpenAlexW2067566981MaRDI QIDQ638499

Liang Yu, Yun Fan

Publication date: 12 September 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.10.003

zbMATH Keywords

\(P_{n,h,s}^{\alpha}\)-procedure\(P_{n,k}\)-procedurecomputably Lipschitz reducibilitymaximal pairs of c.e. realsmeasure of relative randomness

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Algorithmic randomness and dimension (03D32)

Related Items (5)

Non-low\(_2\)-ness and computable Lipschitz reducibility ⋮ Maximal pairs of computably enumerable sets in the computably Lipschitz degrees ⋮ On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets ⋮ Local characterization of block covers and their applications ⋮ A uniform version of non-\(\mathrm{low}_{2}\)-ness

Cites Work

• Unnamed Item
• Unnamed Item
• Randomness and the linear degrees of computability
• A c.e. real that cannot be sw-computed by any \(\Omega\) number
• The ibT degrees of computably enumerable sets are not dense
• Algorithmic Randomness and Complexity
• Random reals and Lipschitz continuity
• The method of the Yu–Ding Theorem and its application
• Working with strong reducibilities above totally $\omega $-c.e. and array computable degrees
• There is no SW-complete c.e. real
• Computability Theory and Differential Geometry

This page was built for publication: Maximal pairs of c.e. reals in the computably Lipschitz degrees