Classes of computational complexity
This chapter studies lowness properties of sets not necessarily below the halting problem. The main new notions are all related to traceability. It characterizes lowness for Schnorr, and computable randomness. It also studies strong jump traceability and its relationship to the cost function method of Chapter 5. Many research problems are posed.
Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.
If you think you should have access to this title, please contact your librarian.