Turing reduction
English
Etymology
After
Alan Turing
.
Noun
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
.
See also
Cook reduction
oracle machine
This article is issued from
Wiktionary
. The text is licensed under
Creative Commons - Attribution - Sharealike
. Additional terms may apply for the media files.