Unformatted text preview: Practice Problems Solve problems 3.15(a), 3.16(a), 4.1, 4.5, 4.9, 4.11, 4.21, and 4.23. Homework Problems Problem 1 . [Category: Proof] Solve problem 3.19. Hint: Use the result of problem 3.18, which was solved in discussion 9. Problem 2 . [Category: Proof] Solve problem 4.17. Problem 3 . [Category: Proof] Consider Inf = { M  M is a TM and L ( M ) is inﬁnite } . Using reductions, prove that Inf is not recursively enumerable (i.e., Turing recognizable). Hint: Reduce a known nonrecognizable language like A TM or L d to Inf. 1...
View
Full Document
 Fall '08
 Viswanathan,M
 Turing

Click to edit the document details