There is no SW-complete c.e. real
From MaRDI portal
Publication:5311772
DOI10.2178/jsl/1102022216zbMath1070.03028MaRDI QIDQ5311772
Publication date: 29 August 2005
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2178/jsl/1102022216
Kolmogorov complexity; random reals; computably enumerable real numbers; strongly weak truth table reducibility
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
03D80: Applications of computability and recursion theory
Related Items
Working with strong reducibilities above totally $\omega $-c.e. and array computable degrees, 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, Maximal pairs of computably enumerable sets in the computably Lipschitz degrees, The ibT degrees of computably enumerable sets are not dense, Calibrating Randomness, Structures of Some Strong Reducibilities, The method of the Yu–Ding Theorem and its application
Cites Work