Keywords

#turing_reduction

Turing reduction

Concept in computability theory

In computability theory, a Turing reduction from a decision problem to a decision problem is an oracle machine that decides problem given an oracle for . It can be understood as an algorithm that could be used to solve if it had available to it a subroutine for solving . The concept can be analogously applied to function problems.

Tue 11th

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Turing reduction Polynomial-time reduction Log-space reduction Reduction (complexity) Many-one reduction List of things named after Alan Turing Alan Turing NP-completeness Turing pattern Church–Turing thesis
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.