André Nies
- Published in print:
- 2009
- Published Online:
- May 2009
- ISBN:
- 9780199230761
- eISBN:
- 9780191710988
- Item type:
- chapter
- Publisher:
- Oxford University Press
- DOI:
- 10.1093/acprof:oso/9780199230761.003.0001
- Subject:
- Mathematics, Logic / Computer Science / Mathematical Philosophy
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 ...
More
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.Less
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.
André Nies
- Published in print:
- 2009
- Published Online:
- May 2009
- ISBN:
- 9780199230761
- eISBN:
- 9780191710988
- Item type:
- chapter
- Publisher:
- Oxford University Press
- DOI:
- 10.1093/acprof:oso/9780199230761.003.0006
- Subject:
- Mathematics, Logic / Computer Science / Mathematical Philosophy
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 ...
More
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.Less
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.
André Nies
- Published in print:
- 2009
- Published Online:
- May 2009
- ISBN:
- 9780199230761
- eISBN:
- 9780191710988
- Item type:
- book
- Publisher:
- Oxford University Press
- DOI:
- 10.1093/acprof:oso/9780199230761.001.0001
- Subject:
- Mathematics, Logic / Computer Science / Mathematical Philosophy
The complexity and the randomness aspect of a set of natural numbers are closely related. Traditionally, computability theory is concerned with the complexity aspect. However, computability theoretic ...
More
The complexity and the randomness aspect of a set of natural numbers are closely related. Traditionally, computability theory is concerned with the complexity aspect. However, computability theoretic tools can also be used to introduce mathematical counterparts for the intuitive notion of randomness of a set. Recent research shows that, conversely, concepts and methods originating from randomness enrich computability theory. The book is about these two aspects of sets of natural numbers and about their interplay. For the first aspect, lowness and highness properties of sets are introduced. For the second aspect, firstly randomness of finite objects are studied, and then randomness of sets of natural numbers. A hierarchy of mathematical randomness notions is established. Each notion matches the intuition idea of randomness to some extent. The advantages and drawbacks of notions weaker and stronger than Martin-Löf randomness are discussed. The main topic is the interplay of the computability and randomness aspects. Research on this interplay has advanced rapidly in recent years. One chapter focuses on injury-free solutions to Post's problem. A core chapter contains a comprehensible treatment of lowness properties below the halting problem, and how they relate to K triviality. Each chapter exposes how the complexity properties are related to randomness. The book also contains analogs in the area of higher computability theory of results from the preceding chapters, reflecting very recent research.Less
The complexity and the randomness aspect of a set of natural numbers are closely related. Traditionally, computability theory is concerned with the complexity aspect. However, computability theoretic tools can also be used to introduce mathematical counterparts for the intuitive notion of randomness of a set. Recent research shows that, conversely, concepts and methods originating from randomness enrich computability theory. The book is about these two aspects of sets of natural numbers and about their interplay. For the first aspect, lowness and highness properties of sets are introduced. For the second aspect, firstly randomness of finite objects are studied, and then randomness of sets of natural numbers. A hierarchy of mathematical randomness notions is established. Each notion matches the intuition idea of randomness to some extent. The advantages and drawbacks of notions weaker and stronger than Martin-Löf randomness are discussed. The main topic is the interplay of the computability and randomness aspects. Research on this interplay has advanced rapidly in recent years. One chapter focuses on injury-free solutions to Post's problem. A core chapter contains a comprehensible treatment of lowness properties below the halting problem, and how they relate to K triviality. Each chapter exposes how the complexity properties are related to randomness. The book also contains analogs in the area of higher computability theory of results from the preceding chapters, reflecting very recent research.
