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:
“Of course I lie to people. But I lie altruistically—for our mutual good. The lie is the basic building block of good manners. That may seem mildly shocking to a moralist—but then what isn’t?”
—Quentin Crisp (b. 1908)
“The reason why men enter into society, is the preservation of their property; and the end why they choose and authorize a legislative, is, that there may be laws made, and rules set, as guards and fences to the properties of all the members of the society: to limit the power, and moderate the dominion, of every part and member of the society.”
—John Locke (1632–1704)
“No sooner met but they looked; no sooner looked but they loved; no sooner loved but they sighed; no sooner sighed but they asked one another the reason; no sooner knew the reason but they sought the remedy; and in these degrees have they made a pair of stairs to marriage, which they will climb incontinent, or else be incontinent before marriage.”
—William Shakespeare (1564–1616)