Author:
Brodhead Paul,Cenzer Douglas,Dashti Seyyed
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Cenzer, D.: Effectively Closed Sets. ASL Lecture Notes in Logic (to appear)
2. Cenzer, D., Remmel, J.B.: $\Pi^0_1$ classes. In: Ersov, Y., Goncharov, S., Marek, V., Nerode, A., Remmel, J. (eds.) Handbook of Recursive Mathematics, Recursive Algebra, Analysis and Combinatorics. Elsevier Studies in Logic and the Foundations of Mathematics, vol. 2, 139, pp. 623–821 (1998)
3. Chaitin, G.: Information-theoretical characterizations of recursive infinite strings. Theor. Comp. Sci. 2, 45–48 (1976)
4. Downey, R., Hirschfeldt, D., Nies, A., Stephan, F.: Trivial reals. In: Proc. 7th and 8th Asian Logic Conference, pp. 101–131. World Scientific Press, Singapore (2003)
5. Gács, P.: On the symmetry of algorithmic information. Soviet Mat. Dokl. 15, 1477–1480 (1974)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Effective Randomness of Unions and Intersections;Theory of Computing Systems;2012-07-04
2. Effective Capacity and Randomness of Closed Sets;Electronic Proceedings in Theoretical Computer Science;2010-06-03
3. Computability of probability measures and Martin-Löf randomness over metric spaces;Information and Computation;2009-07
4. Immunity for Closed Sets;Mathematical Theory and Computational Practice;2009
5. Algorithmic randomness of continuous functions;Archive for Mathematical Logic;2008-01-04