Subject
General Computer Science,Theoretical Computer Science
Reference15 articles.
1. L. Bienvenu, A. Muchnik, A. Shen, N. Vereshchagin, Limit complexities revisited, in: 25th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2008, vol. 08001, Dagstuhl Seminar Proceedings, 2010, pp. 73–84.
2. Uniform almost everywhere domination;Cholak;Journal of Symbolic Logic,2006
3. Algorithmic randomness and complexity;Downey,2010
4. Calibrating randomness;Downey;Bulletin of Symbolic Logic,2006
5. S.M. Kautz, Degrees of random sets. Ph.D. Thesis, Cornell Univeristy, 1991.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献