Higher computability and randomness
Higher computability and randomness
After a brief introduction to higher computability theory, tools from this area are used to obtain mathematical notions of randomness. Many directions from the previous chapters are revisited in this new context. Results often turn out different. For instance, a set that is low for higher Martin–Löf randomness is hyperarithmetical. The chapter studies the strong notion of Pi-11 randomness, which has no counterpart in the classical theory.
Keywords: higher computability, Spector–Gandy theorem, Pi-11 randomness, Delta-11 randomness, hyp-dominated set, Delta-11 traceability
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 .
