Maximal pairs of c.e. reals in the computably Lipschitz degrees
From MaRDI portal
Publication:638499
DOI10.1016/j.apal.2010.10.003zbMath1252.03102MaRDI QIDQ638499
Publication date: 12 September 2011
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2010.10.003
\(P_{n,h,s}^{\alpha}\)-procedure; \(P_{n,k}\)-procedure; computably Lipschitz reducibility; maximal pairs of c.e. reals; measure of relative randomness
03D30: Other degrees and reducibilities in computability and recursion theory
03D32: Algorithmic randomness and dimension
Related Items
A uniform version of non-\(\mathrm{low}_{2}\)-ness, Local characterization of block covers and their applications, Non-low\(_2\)-ness and computable Lipschitz reducibility, Maximal pairs of computably enumerable sets in the computably Lipschitz degrees, On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets
Cites Work
- Unnamed Item
- Unnamed Item
- Randomness and the linear degrees of computability
- A c.e. real that cannot be sw-computed by any \(\Omega\) number
- The ibT degrees of computably enumerable sets are not dense
- Algorithmic Randomness and Complexity
- Random reals and Lipschitz continuity
- The method of the Yu–Ding Theorem and its application
- 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
