The complexity of sets
The complexity of sets
This chapter studies the complexity of sets of natural numbers. There are two interrelated types of complexity, these are computational and descriptive. In both cases, to understand the complexity of sets, this chapter introduces classes of similar complexity, namely, classes of sets sharing a certain complexity property.
Keywords: computational complexity, descriptive complexity, lowness properties, highness properties, Cantor space, uniform measure
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 .