Turing reduction

English

Etymology

After Alan Turing.

Noun

Turing reduction (plural Turing reductions)

1. (computing theory) 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.

See also

• Cook reduction
• oracle machine