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.
随便看	bariandite Bariatric bariatrician bariatrics Bariatric surgery baric Baric. baricalcite baric analysis baric area Baricco Baricella baric field baric flow baric gradient barich baric index baricite baricities baric lapse rate baric low baric minimum Baricon baric topography baric wave