Turing reduction
Short definition from Wiktionary
Noun
- A reduction that solves a problem if the solution to another problem is already known, i.e. an algorithm that could be used to solve A if it had available to it a subroutine for solving B.
We haven’t written up Turing reduction yet: Simple and Standard meanings, examples and a quiz.