Author:
Greenberg Noam,Hirschfeldt Denis R.,Nies André
Funder
Marsden Fund of New Zealand
National Science Foundation of the United States
Reference42 articles.
1. K-trivial degrees and the jump-traceability hierarchy;Barmpalias;Proc. Amer. Math. Soc.,2009
2. Mark Bickford, Chris F. Mills, Lowness properties of r.e. sets, Manuscript, UW Madison, 1982.
3. A theory of program size formally identical to information theory;Chaitin;J. ACM,1975
4. Strong jump-traceabilty I: the computably enumerable case;Cholak;Adv. Math.,2008
5. Mass problems and hyperarithmeticity;Cole;J. Math. Log.,2007
Cited by
12 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
3. Computing from projections of random points;Journal of Mathematical Logic;2019-09-13
4. STRONG JUMP-TRACEABILITY;The Bulletin of Symbolic Logic;2018-06
5. Calculus of Cost Functions;The Incomputable;2017