 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 partially ordered by the relation in the following manner.