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

DOI10.1016/J.APAL.2010.10.003MaRDI QIDQ638499zbMATH OpenOpenAlexFDO

Authors Yun Fan, Liang Yu

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

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

Recommendations

• Maximal pairs of computably enumerable sets in the computably Lipschitz degrees
• New Computational Paradigms
• Non-low\(_2\)-ness and computable Lipschitz reducibility
• Random reals and Lipschitz continuity
• The computable Lipschitz degrees of computably enumerable sets are not dense

Cites work

• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 1834658 (Why is no real title available?)
• A c.e. real that cannot be sw-computed by any \(\Omega\) number
• Algorithmic randomness and complexity.
• Computability Theory and Differential Geometry
• Random reals and Lipschitz continuity
• Randomness and the linear degrees of computability
• The ibT degrees of computably enumerable sets are not dense
• The method of the Yu–Ding Theorem and its application
• There is no SW-complete c.e. real
• Working with strong reducibilities above totally \(\omega \)-c.e. and array computable degrees

Cited in

(7)

• On the strongly bounded Turing degrees of the computably enumerable sets
• Maximal pairs of computably enumerable sets in the computably Lipschitz degrees
• Random reals and Lipschitz continuity
• Local characterization of block covers and their applications
• A uniform version of non-\(\mathrm{low}_{2}\)-ness
• Non-low\(_2\)-ness and computable Lipschitz reducibility
• Randomness and the linear degrees of computability

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q638499)