A C.E. Real That Cannot Be SW-Computed by Any Ω Number-Reference-Cited by-同舟云学术

A C.E. Real That Cannot Be SW-Computed by Any Ω Number

Published:2006-04-01 Issue:2 Volume:47 Page:
ISSN:0029-4527
Container-title:Notre Dame Journal of Formal Logic
language:
Short-container-title:Notre Dame J. Formal Logic

Author:

Barmpalias George,Lewis Andrew E. M.

Publisher

Duke University Press

Subject

Logic

Reference12 articles.

1. [1] Barmpalias, G., "Computably enumerable sets in the Solovay and the strong weak truth table degrees", pp. 8--17 in Lecture Notes in Computer Science (CiE 2005 Conference, Amsterdam), edited by S. B. Cooper et al., vol. 3526, Springer-Verlag, Berlin, 2005.

2. [2] Barmpalias, G., and A. E. M. Lewis, "The $\mathitibt$ degrees of computably enumerable sets are not dense", Annals of Pure and Applied Logic, (2006). forthcoming.

3. [3] Calude, C. S., "A characterization of c.e. random reals. Kolmogorov complexity", Theoretical Computer Science, vol. 271 (2002), pp. 3--14.

4. [4] Downey, R., and D. Hirschfeldt, "Algorithmic randomness and complexity", Monograph in preparation, 2006.

5. [5] Downey, R. G., D. R. Hirschfeldt, and G. LaForte, "Randomness and reducibility", Journal of Computer and System Sciences, vol. 68 (2004), pp. 96--114.

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Non-low2-ness and computable Lipschitz reducibility;Acta Mathematica Sinica, English Series;2017-06-25

2. A uniform version of non-low2-ness;Annals of Pure and Applied Logic;2017-03

3. Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega;Journal of Computer and System Sciences;2016-12

4. Algorithmic Randomness and Measures of Complexity;The Bulletin of Symbolic Logic;2013-09

5. Maximal pairs of c.e. reals in the computably Lipschitz degrees;Annals of Pure and Applied Logic;2011-02