Question: Problem 6 ( 2 0 points ) We formalized the intuitive notion of a reduction that we saw in lecture with the definition of a
Problem points
We formalized the intuitive notion of a reduction that we saw in lecture with the definition of a mapping
reduction. However, there are other ways to formalize the idea of reductions. One formalization, called a
Turing reduction, captures the intuition that in a reduction from to a decider for A can be implemented
by calling, possibly more than once, a decider for as a subroutine. An algorithm with access to a subroutine
for deciding is formalized by the definition of an oracle Turing machine.
Definition Oracle Turing Machine Given language a oracle Turing machine is a multitape
Turing machine with a special tape called the query tape, a special tape called the oracle tape, and a special
state called the query state. If enters the query state, then the output of the question is the string on
the query tape in is written on the oracle tape eg for yes, for no
Note that doesn't compute the answer to the query: in a single computational step, the answer to the
query is output to the oracle tape. You can think of the query and oracle tapes as input and output ports
to an external device that decides for doesn't know or care how the external device answers the
query, it just makes use of the result. Highlevel descriptions of oracle Turing machines are exactly like
highlevel descriptions of Turing machines, except that when descibing a oracle Turing machine you can
additionally say 'query the oracle on input and then condition on the output.
Definition Turing Reduction Given languages we say that is Turing reducible to denoted
if there is a oracle Turing machine that decides We also say that is decidable relative to
a points
Prove that if there is a mapping reduction from to then there is a Turing reduction from to
b points
Give a Turing reduction from to
c points
Prove or disprove the following claim.
Claim If there is a Turing reduction from to then there is a mapping reduction from to
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
