Basic Properties of The Turing Degrees
- Every Turing degree is countably infinite, that is, it contains exactly sets.
- There are distinct Turing degrees.
- For each degree a the strict inequality a < a′ holds.
- For each degree a, the set of degrees below a is at most countable. The set of degrees greater than a has size .
Read more about this topic: Turing Degree
Famous quotes containing the words basic, properties and/or degrees:
“Justice begins with the recognition of the necessity of sharing. The oldest law is that which regulates it, and this is still the most important law today and, as such, has remained the basic concern of all movements which have at heart the community of human activities and of human existence in general.”
—Elias Canetti (b. 1905)
“A drop of water has the properties of the sea, but cannot exhibit a storm. There is beauty of a concert, as well as of a flute; strength of a host, as well as of a hero.”
—Ralph Waldo Emerson (1803–1882)
“Gradually we come to admit that Shakespeare understands a greater extent and variety of human life than Dante; but that Dante understands deeper degrees of degradation and higher degrees of exaltation.”
—T.S. (Thomas Stearns)