This preview shows pages 1–6. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: If A T B and B is decidable, then A is decidable If A T B and A is undecidable, then B is undecidable If A T B and B is Turingrecognizable, then A is Turingrecognizable If A T B and A is nonTuringrecognizable, then B is nonTuringrecognizable November 8, 2005 Today we will do examples Hint for problem 5.20 Show that L1 = {<M>  M is a TM and M halts on at least one input} is undecidable Is L2 = {<M,w,t>  M is a TM that accepts w in at least t steps} decidable? Prove your answer From Sipser 5.13, 5.14, 5.15, 5.24, 5.30 c...
View
Full
Document
 Spring '11
 sm

Click to edit the document details