# hd3_3 - SELECTED SOLUTIONS 163 3.18 Prove that there exists...

• Notes
• 2

This preview shows pages 1–2. Sign up to view the full content.

SELECTED SOLUTIONS 163 3.18 Prove that there exists an infinite decidable subset of A TM . 3.19 Show that a language is decidable iff some enumerator enumerates the language in lexicographic order. 3.20 Show that single-tape TM s that cannot write on the portion of the tape containing the input string recognize only regular languages. 3.21 Let c 1 x n + c 2 x n - 1 + · · · + c n x + c n +1 be a polynomial with a root at x = x 0 . Let c max be the largest absolute value of a c i . Show that | x 0 | < ( n + 1) c max | c 1 | . A 3.22 Let A be the language containing only the single string s , where s = 0 if life never will be found on Mars. 1 if life will be found on Mars someday . Is A decidable? Why or why not? For the purposes of this problem, assume that the question of whether life will be found on Mars has an unambiguous Y ES or N O answer. SELECTED SOLUTIONS 3.1 (b) q 1 00 , q 2 0 , x q 3 , q 5 x , q 5 x , q 2 x , x q 2 , x q accept 3.2 (a) q 1 11 , q 3 1 , 1 q 3 , 1 q reject . 3.3 We prove both directions of the “iff.” First, if a language L is decidable, it can be decided by a deterministic Turing machine, and that is automatically a nondeter- ministic Turing machine. Second, if a language L is decided by a nondeterministic TM N , we construct a deterministic TM D 2 that decides L . Machine D 2 runs the same algorithm that appears in the TM D described in the proof of Theorem 3.3, with an additional

This preview has intentionally blurred sections. Sign up to view the full version.

This is the end of the preview. Sign up to access the rest of the document.
• Spring '09
• Ib
• Halting problem, Alan Turing, Non-deterministic Turing machine

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern