Author:
Downey Rodney G,Griffiths Evan J,Reid Stephanie
Subject
General Computer Science,Theoretical Computer Science
Reference33 articles.
1. K. Ambos-Spies, A. Kučera, Randomness in computability theory, in: P. Cholak, S. Lempp, M. Lerman, R. Shore (Eds.), Computability Theory and its Applications, Contemporary Mathematics, vol. 257, 2000, pp. 1–14.
2. C. Calude, P. Hertling, B. Khoussainov, Y. Wang, Recursively enumerable reals and Chaitin's Ω number, in: M. Morvan, C. Meinel, D. Krob (Eds.), STACS ’98, Springer Lecture Notes in Computer Science, vol. 1373, 1998, pp. 596–606.
3. A theory of program size formally identical to information theory;Chaitin;J. Assoc. Comput. Mach.,1975
4. R. Downey, E. Griffiths, On Schnorr randomness, J. Symbolic Logic, to appear.
5. R. Downey, E. Griffiths, G. LaForte, On Schnorr and computable randomness, martingales, and machines, Math. Logic Quart., to appear.
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献