Reduction (computability theory)

In computability theory, many reducibility relations (also called reductions, reducibilities, and notions of reducibility) are studied. They are motivated by the question: given sets A {\displaystyle A} and B {\displaystyle B} of natural numbers, is it possible to effectively convert a method for deciding membership in B {\displaystyle B} into a method for deciding membership in A {\displaystyle A} ?

Source: Wikipedia — Reduction (computability theory) (CC BY-SA 4.0)