Author:
Greenberg Noam,Miller Joseph S.,Monin Benoit,Turetsky Daniel
Reference18 articles.
1. [7] Hölzl, R., and A. Nies, “CCR 2014: Open questions,” in Logic Blog, 2014, Part 1, Section 1, edited by A. Nies, available at http://arxiv.org/abs/1504.08163.
2. [12] Nies, A., Computability and Randomness, vol. 51 of Oxford Logic Guides, Oxford University Press, Oxford, 2009.
3. [1] Chaitin, G. J., “Algorithmic information theory,” IBM Journal of Research and Development, vol. 21 (1977), pp. 350–59.
4. [2] Day, A. R., and J. S. Miller, “Cupping with random sets,” Proceedings of the American Mathematical Society, vol. 142 (2014), pp. 2871–79.
5. [3] Downey, R., and D. R. Hirschfeldt, Algorithmic Randomness and Complexity, Theory and Applications of Computability, Springer, New York, 2010.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Martin–Löf reducibility and cost functions;Israel Journal of Mathematics;2023-11-13
2. Spotted disk and sphere graphs. II;Israel Journal of Mathematics;2023-11-13