Definitions from Wiktionary (Turing reduction)
▸ noun: (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.
▸ Words similar to Turing reduction
▸ Usage examples for Turing reduction
▸ Idioms related to Turing reduction
▸ Wikipedia articles (New!)
▸ Words that often appear near Turing reduction
▸ Rhymes of Turing reduction
▸ Invented words related to Turing reduction
▸ noun: (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.
Similar:
gadget,
Turing jump,
Turing,
universal Turing machine,
reverse Turing test,
oracle machine,
reducer,
Turing switch,
Turing machine,
optimization,
more...
▸ Words similar to Turing reduction
▸ Usage examples for Turing reduction
▸ Idioms related to Turing reduction
▸ Wikipedia articles (New!)
▸ Words that often appear near Turing reduction
▸ Rhymes of Turing reduction
▸ Invented words related to Turing reduction