Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference31 articles.
1. Maximal pairs of computably enumerable sets in the computably Lipschitz degrees;Ambos-Spies;Theory Comput. Syst.,2013
2. Complexity of programs to determine whether natural numbers not greater than n belong to recursively enumerable set;Barzdin;Sov. Math. Dokl.,1968
3. Computably enumerable sets in the Solovay and the strong weak truth table degrees;Barmpalias,2005
4. Elementary differences between the degrees of unsolvability and the degrees of compressibility;Barmpalias;Ann. Pure Appl. Log.,2010
5. Relative randomness and cardinality;Barmpalias;Notre Dame J. Form. Log.,2010
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献