Author:
Barmpalias George,Fang Nan,Lewis-Pye Andrew
Funder
Chinese Government
Chinese Academy of Sciences
CAS
Institute of Software of the CAS
Marsden
China Basic Research Program
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference44 articles.
1. Maximal pairs of computably enumerable sets in the computably Lipschitz degrees;Ambos-Spies;Theory Comput. Syst.,2013
2. Computably enumerable sets in the Solovay and the strong weak truth table degrees;Barmpalias,2005
3. Kolmogorov complexity and Solovay functions;Bienvenu,2009
4. Working with strong reducibilities above totally ω-c.e. and array computable degrees;Barmpalias;Trans. Am. Math. Soc.,2010
5. On random and hard-to-describe numbers;Bennett,1979
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献