Turing reduction
Jump to navigation
Jump to search
English[edit]
Etymology[edit]
After Alan Turing.
Noun[edit]
Turing reduction (plural Turing reductions)
- (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.