The method of the Yu–Ding Theorem and its application

DOI10.1017/S0960129508007275zbMath1165.03020OpenAlexW2113200913MaRDI QIDQ3616226

Yun Fan

Publication date: 24 March 2009

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129508007275

zbMATH Keywords

computably Lipschitz reducibilitycomputably Lipschitz degree

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Other degrees and reducibilities in computability and recursion theory (03D30) Higher-type and set recursion theory (03D65)

Related Items (2)

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

Cites Work

• Randomness and the linear degrees of computability
• A c.e. real that cannot be sw-computed by any \(\Omega\) number
• Random reals and Lipschitz continuity
• There is no SW-complete c.e. real

This page was built for publication: The method of the Yu–Ding Theorem and its application