Content deleted Content added
→Reductions stronger than Turing reducibility: fixed weak truth-table reducibility link |
|||
Line 13:
Every reducibility relation (in fact, every preorder) induces an equivalence relation on the powerset of the natural numbers in which two sets are equivalent if and only if each one is reducible to the other. In recursion theory, these equivalence classes are called the '''degrees''' of the reducibility relation. For example, the Turing degrees are the equivalence classes of sets of naturals induced by Turing reducibility.
The degrees of any reducibility relation are [[partial order|partially ordered]] by the relation in the following manner. Let ≤ be a reducibility relation and let '''A''' and '''B''' be two of its degrees. Then '''A''' ≤ '''B''' if and only if there is a set ''A'' in '''A''' and a set ''B'' in '''B''' such that ''A'' ≤ ''B''. This is equivalent to the property that for every set ''A'' in '''A''' and every set ''B'' in '''B''', ''A'' ≤ ''B'', because any two sets in ''A'' are equivalent and any two sets in ''B'' are equivalent. It is common, as shown here, to use boldface notation to denote degrees. chanf
== Turing reducibility ==
| |||