# hw11sol - Computer Science 340 Reasoning about Computation...

• Homework Help
• PresidentHackerCaribou10582
• 4
• 100% (4) 4 out of 4 people found this document helpful

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

Computer Science 340 Reasoning about Computation Homework 11 Due on Friday, December 14, 2007 For this homework, read Section 5.3 on Mapping Reducibility in the notes distributed in class. Problem 1 Recall that E TM = {h M i| M is a TM and L ( M ) = ∅} . Prove that E TM is Turing-recognizable. Solution: We claim that the following TM recognizes the language E TM . N on input w : 1. If w is not an encoding of a TM, then w 6∈ E TM . Hence N can already accept w at this point. 2. Otherwise, let M be the TM encoded by w . 3. Let i be a counter. Initially set i = 1. 4. For all strings x of length at most i , simulate M on x for i steps. If M accepted some string during these simulations, then L ( M ) 6 = . Hence w = h M i 6∈ E TM and N can accept w at this point. 5. Increment i by one, and go back to step (4). We already argued that N accepts only if the input w belongs to E TM . We still need to argue about the converse: if w belongs to E TM , then N accepts w . Let w be a word in E TM . Then, either w is not a TM or w encodes a machine M with L ( M ) 6 = . In the former case, N will accept w in step (1). In the latter case, there is a word x such that x L ( M ). Suppose that x has length j and that M accepts x after j steps. Then N will accept w = h M i when the counter i assumes a value larger than both j and j 0 . If the counter does not reach this value then N must have accepted earlier (which is possible and perfectly fine). It is not possible that

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.
• Fall '07
• CharikarandChazelle
• Turing reduction, Polynomial-time reduction, mapping reduction, Many-one reduction, Log-space reduction

{[ 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