Author:
Zheng Xizhong,Rettinger Robert
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Ambos-Spies, K., Weihrauch, K., Zheng, X.: Weakly computable real numbers. Journal of Complexity 16(4), 676–690 (2000)
2. Calude, C.S., Hertling, P.H.: Computable approximations of reals: an information-theoretic analysis. Fund. Inform. 33(2), 105–120 (1998)
3. Calude, C.S., Hertling, P.H., Khoussainov, B., Wang, Y.: Recursively enumerable reals and Chaitin Ω numbers. Theoretical Computer Science 255, 125–149 (2001)
4. Chaitin, G.: A theory of program size formally identical to information theory. J. of ACM 22, 329–340 (1975)
5. Downey, R.G., Hirschfeldt, D.R.: Algorithmic Randomness and Complexity. Springer, Heidelberg (200) (monograph to be published)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献