This preview shows page 1. Sign up to view the full content.
Unformatted text preview: Proof Proof S="On input M , w where M is a TM: 1. Compute an encoding M 1 of TM M 1 . 2. Run R on input M 1 . 3. If R rejects - accept, otherwise - reject. Recall that R is a decider for ETM . If R rejects the modified machine M 1 , L(M 1 ) , hence by the specification of M 1 , w L(M ) , and a decider for ATM must accept M , w . If however R accepts, it means that L(M 1 ) = , hence w L(M ), and S must reject M , w . QED
38 37 ...
View Full Document
This note was uploaded on 04/30/2009 for the course CSE 105 taught by Professor Paturi during the Winter '99 term at UCSD.
- Winter '99