## Homework #3

Posted by James on April 14, 2011

**Due:** Wednesday, April 20th, in class.

**Reading assignment: Sipser, Chapter 5.**

In solving the problem sets, you are allowed to collaborate with fellow students taking the class, but remember that you are **required to write up the solutions by yourself.** If you do collaborate in any way, you must acknowledge, for each problem, the people you worked with on that problem.

The problems have been carefully chosen for their pedagogical value, and hence might be similar to those given in past offerings of this course at UW, or similar to other courses at other schools. Using any pre-existing solutions from these sources, for from the web, constitutes a violation of the academic integrity you are expected to exemplify, and is strictly prohibited.

Most of the problems only require one or two key ideas for their solution. It will help you a lot to **spell out** these main ideas so that you can get most of the credit for a problem even if you err on the finer details.

A final piece of advice: Start working on the problem sets early! Don’t wait until the day (or few days) before they’re due.

**Problems**

**Each problem is worth 20 points unless otherwise noted.
**

**Decidable or undecidable?**Which of the following problems about Turing machines is decidable and which is not? Briefly justify your answers.

- To determine, given a Turing machine M, whether M ever moves its head to the left when it is run on an input w.
- To determine, given a Turing machine M, whether it ever writes 0000 at any place on the tape, when run on the input 1111.
- To determine whether a Turing machine M ever modifies the input portion of the tape when run on input 1111.
- To determine, given a Turing machine M and an input w, whether M ever moves its tape head off the input portion of the tape.

**Separation.**Let A and B be two

*disjoint*languages. Say that C**separates**A and B if and . Show that any two disjoint co-Turing-recognizable languages are separable by some decidable language.**Mapping reducibility.**- Prove that a language A is Turing-recognizable if and only if A is mapping reducible to .
- Prove that a language B is Turing-decidable if and only if B is mapping reducible to PALINDROMES.

**Unary!**Show that there is an undecidable language .

## Mary said

Totally unrelated, but here’s a neat poem about the halting problem:

http://www.bemuzed.com/lucasd/halting-poem.html