Affiliation:
1. Department of Mathematics, London School of Economics, London, UK. andy@aemlewis.co.uk
Subject
Artificial Intelligence,Computational Theory and Mathematics,Computer Science Applications,Theoretical Computer Science
Reference43 articles.
1. S.B. Cooper, Computability Theory, Chapman & Hall, 2004.
2. The strong anticupping property for recursively enumerable degrees;Cooper;Journal of Symbolic Logic,1989
3. Extensions of embeddings below computably enumerable degrees;Downey;Transactions of the American Mathematical Society,2013
4. R. Downey and D. Hirschfeldt, Algorithmic Randomness and Complexity, Springer-Verlag, 2010.
5. R. Downey, C.G. Jockusch and M. Stob, Array nonrecursive degrees and genericity, in: Computability, Enumerability, Unsolvability: Directions in Recursion Theory, S.B. Cooper, T.A. Slaman and S.S. Wainer, eds, London Mathematical Society Lecture Note Series, Vol. 224, Cambridge University Press, 1996, pp. 93–104.