Random reals and Lipschitz continuity
From MaRDI portal
Publication:3422017
DOI10.1017/S0960129506005445zbMath1117.03053MaRDI 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
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, A uniform version of non-\(\mathrm{low}_{2}\)-ness, Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega, Randomness and the linear degrees of computability, Non-low\(_2\)-ness and computable Lipschitz reducibility, Bounded Turing reductions and data processing inequalities for sequences, Where join preservation fails in the bounded Turing degrees of c.e. sets, On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets, Some Questions in Computable Mathematics, The method of the Yu–Ding Theorem and its application
