Some advanced computability theory
Some advanced computability theory
This chapter develops the language of building Turing functionals which is used to characterize promptly simple degrees by low cuppability, and to prove the pseudo-jump inversion theorem of Jockusch and Shore. It provides a new pseudo-jump inversion theorem for Martin–Löf randomness. These results are used to separate highness properties, for instance superhighness from being LR-hard.
Keywords: Turing functional, promptly simple degree, low cuppability, pseudo-jump inversion, Jockusch and Shore, highness property, superhighness
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.
Please, subscribe or login to access full text content.
If you think you should have access to this title, please contact your librarian.
To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .
