A uniform version of non-\(\mathrm{low}_{2}\)-ness

DOI10.1016/j.apal.2016.10.013zbMath1422.03087OpenAlexW2535167946MaRDI QIDQ730092

Yun Fan

Publication date: 23 December 2016

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.2016.10.013

zbMATH Keywords

(uniformly) non-\(\mathrm{low}_2\)-nesscommon upper boundcomputable Lipschitz reducibility

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (1)

Non-low\(_2\)-ness and computable Lipschitz reducibility

Cites Work

• Unnamed Item
• Unnamed Item
• Maximal pairs of c.e. reals in the computably Lipschitz degrees
• Randomness and the linear degrees of computability
• A c.e. real that cannot be sw-computed by any \(\Omega\) number
• Turing degrees of reals of positive effective packing dimension
• Randomness and reducibility
• Algorithmic Randomness and Complexity
• Random reals and Lipschitz continuity
• Working with strong reducibilities above totally $\omega $-c.e. and array computable degrees
• There is no SW-complete c.e. real
• Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets
• Computability Theory and Differential Geometry

This page was built for publication: A uniform version of non-\(\mathrm{low}_{2}\)-ness