Turing reduction
Turing reduction 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.
Noun
Turing reduction (plural Turing reductions)
- 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.
Forms of Turing reduction
| plural | Turing reductions |
|---|
Origin of Turing reduction
After Alan Turing.
Questions about Turing reduction
- What does Turing reduction mean?
- Turing reduction means 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.
- What part of speech is Turing reduction?
- Turing reduction is a noun.
- What is the plural of Turing reduction?
- The plural of Turing reduction is Turing reductions.
Words near Turing reduction in the dictionary
Source and license
Adapted from Wiktionary: Turing reduction (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.
Last updated:
Cite this entry: “Turing reduction.” Word.ws, https://word.ws/turing_reduction. Based on Wiktionary, CC BY-SA 4.0.
