Reference30 articles.
1. An algebraic decomposition of the recursively enumerable degrees and the coincidence of several degree classes with the promptly simple degrees;Ambos-Spies;Trans. Amer. Math. Soc.,1984
2. Randomness in computability theory;Ambos-Spies,2000
3. A. Nies, B. Bedregal, Lowness properties of reals and hyper-immunity, in: Wollic 2003, Electronic Notes in Theoretical Computer Science, vol. 84, Elsevier, Amsterdam, 2003. http://www.elsevier.nl/locate/entcs/volume84.html.
4. C. Calude, Information and randomness, Monographs in Theoretical Computer Science, An EATCS Series. Springer, Berlin, 1994. An algorithmic perspective, With forewords by Gregory J. Chaitin and Arto Salomaa.
5. Program-size complexity of initial segments and domination reducibility;Calude,1999
Cited by
147 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献