Author:
Downey Rod G.,Hirschfeldt Denis R.,LaForte Geoff
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference56 articles.
1. K. Ambos-Spies, A. Kučera, Randomness in computability theory, in: P.A. Cholak, S. Lempp, M. Lerman, R.A. Shore (Eds.), Computability Theory and Its Applications, Boulder, CO, 1999; Contemporary Mathematics, Vol. 257, American Mathematical Society, Providence, RI, 2000, pp. 1–14.
2. Weakly computable real numbers;Ambos-Spies;J. Complexity,2000
3. Complexity of programs to determine whether natural numbers not greater than n belong to a recursively enumerable set;Barzdins;Soviet Math. Dokl.,1968
4. A characterization of c.e. random reals;Calude;Theoret. Comput. Sci.,2002
5. Information and Randomness, an Algorithmic Perspective, Monographs in Theoretical Computer Science;Calude,1994
Cited by
50 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献