UGC NET CSE | June 2023 | Part 2: 74

Question

 

1. The set of turning machine codes for $\text{TM's}$ that accept all inputs that are palindromes (possible along with some other inputs) is decidable
2. The language of codes for $\text{TM's}$ $\text{M}$ that when started with blank tape, eventually write a $1$ somewhere on the tape is undecidable
3. The language accepted by a $\text{TM M }$is $\text{L (M)}$ is always recursive
4. Post's correspondence problem is undecidable

Choose the correct answer from the options given below:

• A. $\text{i, ii}$ and $\text{iii}$ only
• B. $\text{ii, iii}$ and $\text{iv}$ only
• C. $\text{i}$ and $\text{iii}$ only
• D. $\text{ii}$ and $\text{iv}$ only