Professional Documents
Culture Documents
heory of Computatio
Turing reducibility
Section 6.3
6.3.a
Giorgi Japaridze
Theory of Computability
6.3.b
Giorgi Japaridze
Theory of Computability
Theorem 6.21:
a) If ATB and B is decidable, then A is decidable.
Consequently,
b) If ATB and A is undecidable, then B is undecidable.
Proof (a): If B is decidable, then we may replace the oracle for B by
an actual procedure that decides B. Thus we may replace the OTM
that decides A relative to B by an ordinary TM that decides A.