Maximal pairs of computably enumerable sets in the computably Lipschitz degrees

DOI10.1007/s00224-012-9424-1zbMath1273.03140OpenAlexW1976148933MaRDI QIDQ1946505

Yun Fan, Wolfgang Merkle, Ding, Decheng, Ambos-Spies, Klaus

Publication date: 15 April 2013

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-012-9424-1

zbMATH Keywords

computably enumerable setscomputably Lipschitz degreesmaximal pairs

Mathematics Subject Classification ID

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

Related Items

Where join preservation fails in the bounded Turing degrees of c.e. sets, Universal computably enumerable sets and initial segment prefix-free complexity, On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets, Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The computable Lipschitz degrees of computably enumerable sets are not dense
• Maximal pairs of c.e. reals in the computably Lipschitz degrees
• Randomness and the linear degrees of computability
• Randomness and reducibility
• The ibT degrees of computably enumerable sets are not dense
• Algorithmic Randomness and Complexity
• Structures of Some Strong Reducibilities
• The method of the Yu–Ding Theorem and its application
• Cupping and noncapping in the r.e. weak truth table and turing degrees
• Working with strong reducibilities above totally $\omega $-c.e. and array computable degrees
• There is no SW-complete c.e. real
• New Computational Paradigms
• Computability Theory and Differential Geometry