Random reals and Lipschitz continuity

DOI10.1017/S0960129506005445zbMath1117.03053OpenAlexW2084036268MaRDI QIDQ3422017

George Barmpalias, Andrew E. M. Lewis

Publication date: 9 February 2007

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

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

zbMATH Keywords

randomnessincomputabilitycl degreesquasi-maximality

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Applications of computability and recursion theory (03D80)

Related Items (12)

Randomness and the linear degrees of computability ⋮ Where join preservation fails in the bounded Turing degrees of c.e. sets ⋮ Non-low\(_2\)-ness and computable Lipschitz reducibility ⋮ The computable Lipschitz degrees of computably enumerable sets are not dense ⋮ On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets ⋮ Maximal pairs of c.e. reals in the computably Lipschitz degrees ⋮ Some Questions in Computable Mathematics ⋮ Working with strong reducibilities above totally $\omega $-c.e. and array computable degrees ⋮ Bounded Turing reductions and data processing inequalities for sequences ⋮ A uniform version of non-\(\mathrm{low}_{2}\)-ness ⋮ The method of the Yu–Ding Theorem and its application ⋮ Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega

This page was built for publication: Random reals and Lipschitz continuity