This preview shows page 1. Sign up to view the full content.
Unformatted text preview: C = {h M,k i  M is a TM which accepts some string of length k but M loops on some (other) string of length k } . (Assume that the underlying alphabet has at least two characters.) Problem 3. Sipser Page 195, Problem 5.9. Problem 4. Sipser Page 195, Problem 5.13. Problem 5. Prove the following. A. 2 n is O ( n !) B. n ! is O (2 n 2 ) C. 2 n +100000000 is O (2 n ) Bonus. Show that the following language is not Turingrecognizable INFINITE TM = {h M i  M is a Turing machine and L ( M ) is inﬁnite } 1...
View
Full
Document
This note was uploaded on 02/22/2010 for the course CS 881 taught by Professor H.f. during the Spring '10 term at Shahid Beheshti University.
 Spring '10
 H.F.

Click to edit the document details