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... Wikipedia