Abstract
We now know that there are 1) infinitely many T-degrees; 2) the relation < defined between these T-degrees; and 3) the operator Turing jump that constructs from a given set a new set at a higher T-degree. In this chapter, T-degrees will become the main object of our research. It will be useful to view T-degrees as members of a certain class, \( \mathcal{D} \). We will define this class as a mathematical structure endowed with a relation and a function that we will found on < and ′, respectively. This view will simplify our expression and the investigation of the properties of the structure.
A structure is something that consists of parts connected together in an ordered way.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Robič, B. (2015). The Class \( \mathcal{D} \) of Degrees of Unsolvability. In: The Foundations of Computability Theory. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44808-3_13
Download citation
DOI: https://doi.org/10.1007/978-3-662-44808-3_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44807-6
Online ISBN: 978-3-662-44808-3
eBook Packages: Computer ScienceComputer Science (R0)