Search 207,916,127 papers from all fields of science

Search

Sign InCreate Free Account

Turing reduction

Known as: Turing reducible, Turing reducibility, Turing complete (reduction)Expand

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… Expand