The method of the Yu–Ding Theorem and its application
From MaRDI portal
Publication:3616226
DOI10.1017/S0960129508007275zbMath1165.03020MaRDI QIDQ3616226
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
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
03D30: Other degrees and reducibilities in computability and recursion theory
03D65: Higher-type and set recursion theory
Related Items
Maximal pairs of c.e. reals in the computably Lipschitz degrees, Maximal pairs of computably enumerable sets in the computably Lipschitz degrees
Cites Work