Author:
Barmpalias George,Lewis-Pye Andrew
Publisher
Springer International Publishing
Reference18 articles.
1. Ambos-Spies, K., Weihrauch, K., Zheng, X.: Weakly computable real numbers. J. Complex. 16(4), 676–690 (2000)
2. Barmpalias, G., Downey, R., Greenberg, N.: Working with strong reducibilities above totally
$$\omega $$
-c.e. and array computable degrees. Trans. Am. Math. Soc. 362(2), 777–813 (2010)
3. Bennett, C.H.: Logical depth and physical complexity. In: The Universal Turing Machine: A Half-Century Survey, pp. 227–257. Oxford University Press (1988)
4. Barmpalias, G., Lewis-Pye, A.: Differences of halting probabilities.
arXiv:1604.00216
[cs.CC], April 2016
5. Calude, C., Hertling, P., Khoussainov, B., Wang, Y.: Recursively enumerable reals and Chaitin
$$\Omega $$
numbers. Theor. Comput. Sci. 255(1–2), 125–149 (2001)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献