This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: I have written the first line of P for you. P = “On input x: 1. If x ∈ FL, accept 2. Run M on input w 3. If M accepts w, accept ” (3) (3 points) Using F (the decider for FINITE TM ) and P (your answer to (2)), create a decider S for A TM . You don’t need to argue that S is a decider or that L(S)=A TM . S = “On input <M,w>, where M is a TM 1. Create TM P from question (2) 2. Submit <P> to TM F 3. If F accepts <P>, reject 4. If F rejects <P>, accept ” (4) (3 point) Based on the decider presented in (3), what can you conclude? Why does your conclusion follow? FINITE TM is not decidable. This follows because (3) demonstrates that if FINITE TM is decidable, then A TM is also decidable, but we know that A TM is undecidable....
View Full Document
- Spring '11
- Halting problem, FINITETM