Turing reduction

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English[edit]

Etymology[edit]

After Alan Turing.

Noun[edit]

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[edit]

Retrieved from "https://en.wiktionary.org/w/index.php?title=Turing_reduction&oldid=44596691"