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:
“There’s one basic rule you should remember about development charts that will save you countless hours of worry.... The fact that a child passes through a particular developmental stage is always more important than the age of that child when he or she does it. In the long run, it really doesn’t matter whether you learn to walk at ten months or fifteen months—as long as you learn how to walk.”
—Lawrence Kutner (20th century)
“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)
“I was by degrees awakened as from a dream, and feared that my whole life could properly be counted nothing else but a fantastic vision.”
—Sarah Fielding (1710–1768)