In computability theory, a Turing reduction from a decision problem A {\displaystyle A} to a decision problem B {\displaystyle B} is an oracle machine...

polynomial-time reduction, from the most to the least restrictive, are polynomial-time many-one reductions, truth-table reductions, and Turing reductions. The most...

computational complexity theory, a log-space reduction is a reduction computable by a deterministic Turing machine using logarithmic space. Conceptually...

two main types of reductions used in computational complexity, the many-one reduction and the Turing reduction. Many-one reductions map instances of one...

{\displaystyle L_{1}} . Many-one reductions are a special case and stronger form of Turing reductions. With many-one reductions, the oracle (that is, our solution...

an elder brother, John Ferrier Turing, father of Sir John Dermot Turing, 12th Baronet of the Turing baronets. Turing's father's civil service commission...

language) Turing reduction Turing Robot, China Turing scheme Turing Street - A road in East London Turing switch Turing table Turing tarpit Turing test Computer...

The Turing pattern is a concept introduced by English mathematician Alan Turing in a 1952 paper titled "The Chemical Basis of Morphogenesis" which describes...

term reduction was used in the technical meaning of a polynomial-time many-one reduction. Another type of reduction is polynomial-time Turing reduction. A...

Institute Turing Lecture Turing machine Turing patterns Turing reduction Turing switch Turing test Various institutions have paid tribute to Turing by naming...