Scribd
Upload
31 views1 page

CS5371 Theory of Computation

This document provides the instructions for Homework 4 in the Theory of Computation course CS5371. It lists 6 problems to solve related to Turing machines and computability. Problem 1 asks to show that the set T of Turing machines that accept the reverse of all strings it accepts is undecidable. Problem 2 asks to show that the special Post Correspondence Problem where string lengths match is decidable.

Uploaded by

Kamal Walia
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
31 views1 page

CS5371 Theory of Computation

This document provides the instructions for Homework 4 in the Theory of Computation course CS5371. It lists 6 problems to solve related to Turing machines and computability. Problem 1 asks to show that the set T of Turing machines that accept the reverse of all strings it accepts is undecidable. Problem 2 asks to show that the special Post Correspondence Problem where string lengths match is decidable.

Uploaded by

Kamal Walia
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

CS5371 Theory of Computation

Homework 4
Due: 3:20 pm, December 21, 2007 (before class)

1. (20%) Let T = {hM i | M is a TM that accepts wR whenever it accepts w}. Show that T
is undecidable.

2. (15%) In the silly Post Correspondence Problem, SPCP, in each pair the top string has the
same length as the bottom string. Show that SPCP is decidable.

3. (20%) Show that A is Turing-recognizable if and only if A ≤m AT M .

4. (20%) Show that A is decidable if and only if A ≤m 0∗ 1∗ .

5. (25%) Let J = {w | either w = 0x for some x ∈ AT M , or w = 1y for some y ∈ / AT M }.


¯ Conclude that J and J¯ are non-Turing-recognizable.
Show that AT M ≤m J and AT M ≤m J.

6. (Further studies: No marks) Let K = {hM i | M is a TM and L(M ) = {hM i}}. Show that
neither K nor the complement of K is Turing-recognizable.

You might also like