Recursion theory text, alternative to Soare I want/need to learn some recursion theory, roughly equivalent to parts A and B of Soare's text. This covers "basic graduate material", up to Post's problem, oracle constructions, and the finite injury priority method. Is there an alternate, more beginner friendly version of this material in another text? (At a roughly senior undergraduate or beginning graduate level of difficulty, although I wouldn't necessarily mind easier.)
For example, one text I've seen is S. Barry Cooper's book, Computability Theory. Is there anybody that has read both this and Soare, and could tell me about their similarities/differences?

A popular introductory textbook that covers both computability and complexity is Michael Sipser's "Introduction to the Theory of Computation". The computability section concludes with a nice chapter on advanced computability issues.
