Author:
Figueira Santiago,Nies André,Stephan Frank
Subject
General Computer Science,Theoretical Computer Science
Reference12 articles.
1. An algebraic decomposition of the recursively enumerable degrees and classes equal to the promptly simple degrees;Ambos-Spies;Transactions of the American Mathematical Society,1984
2. M. Bickford and F. Mills, Lowness properties of r.e. sets, Manuscript, UW Madison, 1982
3. Recursively enumerable reals and Chaitin's Ω number;Calude,1998
4. A theory of program size formally identical to information theory;Chaitin;Journal of the Association for Computing Machinery,1975
5. Trivial reals;Downey,2003
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Strengthening prompt simplicity;The Journal of Symbolic Logic;2011-09
2. Beyond strong jump traceability;Proceedings of the London Mathematical Society;2010-09-13
3. Algorithmic Randomness and Complexity;Theory and Applications of Computability;2010
4. -trivial degrees and the jump-traceability hierarchy;Proceedings of the American Mathematical Society;2009-01-22
5. Lowness for Demuth Randomness;Mathematical Theory and Computational Practice;2009