Turing reduction

（重定向自Turing reducibility）

In computability theory, a Turing reduction from a problem A to a problem B, is a reduction which solves A, assuming the solution to B is already known (Rogers 1967, Soare 1987). It can be understood as an algorithm that could be used to solve A if it had available to it a subroutine for solving B. More formally, a Turing reduction is a function computable by an oracle machine with an oracle for B. Turing reductions can be applied to both decision problems and function problems.

单词	Turing reducibility
释义	Turing reducibility 英语百科 Turing reduction （重定向自Turing reducibility） In computability theory, a Turing reduction from a problem A to a problem B, is a reduction which solves A, assuming the solution to B is already known (Rogers 1967, Soare 1987). It can be understood as an algorithm that could be used to solve A if it had available to it a subroutine for solving B. More formally, a Turing reduction is a function computable by an oracle machine with an oracle for B. Turing reductions can be applied to both decision problems and function problems.
随便看	positive value的意思 positive valve的意思 positive variance的意思 Positive variation的意思 positive variation of signed measure的意思 positive vascular conditioned reflex的意思 positive vector的意思 positive venous pulse的意思 positive ventilating的意思 positive ventilation的意思 positive verification的意思 positive vertical divergence的意思 positive vetting的意思 positive video signal的意思 positive visual hallucination的意思 positive voltage的意思 positive voltage ECL的意思 positive voltage ECL, PECL的意思 positive voluntary accommodation的意思 positive waste的意思 positive wave的意思 positive wave potential的意思 positive weight的意思 positive whole number的意思 positive wing tip rake的意思