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

DOI10.1007/s10114-017-6585-5zbMath1453.03038OpenAlexW2636394843MaRDI QIDQ1682262

Yun Fan

Publication date: 29 November 2017

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-017-6585-5

zbMATH Keywords

complexcomputable Lipschitz (cl) reducibilitynon-low\(_2\)-ness

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Algorithmic randomness and dimension (03D32) Computation over the reals, computable analysis (03D78)

Cites Work

• Unnamed Item
• Maximal pairs of c.e. reals in the computably Lipschitz degrees
• A uniform version of non-\(\mathrm{low}_{2}\)-ness
• Randomness and the linear degrees of computability
• A c.e. real that cannot be sw-computed by any \(\Omega\) number
• Kolmogorov complexity and the Recursion Theorem
• 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
• Computability Theory and Differential Geometry

This page was built for publication: Non-low\(_2\)-ness and computable Lipschitz reducibility