 This gives a powerful technique for proving that many sets are noncomputable.A reducibility relation is a binary relation on sets of natural numbers that is 
These two properties imply that a reducibility is a preorder on the powerset of the natural numbers.Not all preorders are studied as reducibility notions, however.