edited by
3,147 views
24 votes
24 votes

The aim of the following question is to prove that the language $\{M \mid M$ $\text {is the code of the Turing Machine which, irrespective of the input, halts and outputs a}$ $1\}$, is undecidable. This is to be done by reducing from the language $\{M', x \mid M'$ $\text{ halts on }$ $x\}$, which is known to be undecidable. In parts (a) and (b) describe the $2$ main steps in the construction of $M$. In part (c) describe the key property which relates the behaviour of $M$ on its input w to the behaviour of $M'$ on $x$.

  1. On input $w$, what is the first step that $M$ must make?
  2. On input $w$, based on the outcome of the first step, what is the second step $M$ must make?
  3. What key property relates the behaviour of $M$ on $w$ to the behaviour of $M'$ on $x$?
edited by

1 Answer

Best answer
14 votes
14 votes
  1. $M$ erases its input $w$ and simulate the moves of $M'$ on $x$. Thus if $M'$ halts on $x, M$ accepts any input ($\Sigma^*$) and if $M'$ doesn't halt on $x, M$ accepts no string ($\phi$)
     
  2. Give the description of $M$ - <$M$> to the TM that decides $L$. If TM accepts <$M$>, $M$ halts on all inputs $\rightarrow M'$ accept $x$. If TM rejects <$M$>, $M$ doesn't halt on some input $\rightarrow M'$ doesn't halt on $x$, due to our construction of $M$ in $1$st step. Thus we decide halting problem
     
  3. $M$ halting on all inputs $w$ is the key property relating to $M'$ which is halting on a given input $x$
edited by

Related questions

17 votes
17 votes
2 answers
1
gatecse asked Aug 20, 2014
2,331 views
$L= \{\langle M \rangle\mid L(M) = \Sigma^*\} $A. $L$ is RE but $L'$ is not REB. Both $L$ and $L'$ are REC. $L$ is not RE but $L'$ is RED. Both $L$ and $L'$ are not RE...
17 votes
17 votes
4 answers
2
gatecse asked Aug 20, 2014
5,640 views
$L= \{\langle M\rangle \mid L(M)\text{ is infinite}\}$$L$ is RE but $L'$ is not REBoth $L$ and $L'$ are RE$L$ is not RE but $L'$ is REBoth $L$ and $L'$ are not RE
25 votes
25 votes
1 answer
3
Kathleen asked Sep 15, 2014
4,169 views
We require a four state automaton to recognize the regular expression $(a\mid b)^*abb$Give an NFA for this purposeGive a DFA for this purpose