BRZEN
Turing reduction
Texto da Wikipédia (en), licença CC BY-SA. O BETARUBI mostra o verbete inteiro nesta página — a leitura não continua fora do site.
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 in finitely many steps. It can be understood as an algorithm that could be used to solve if it had access to a subroutine for solving . The concept can be analogously applied to function problems.