Computer Science · Theory of Computation
Consider the following statements regarding Turing Machines (TM): A. The set of Turing machine codes for TMs that accept all inputs that are palindromes (possibly along with some other inputs) is decidable. B. The language of codes for TMs M that, when started with a blank tape, eventually write a 1 somewhere on the tape is undecidable. C. The language accepted by a TM M, denoted as L(M), is always recursive. D. Post's correspondence problem is undecidable. Choose the correct answer from the options given below:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1B and D only✓
- 2A and C only
- 3B, C and D only
- 4A, B and C only
Correct answer
B and D only
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Theory of Computation MCQs →Want more practice questions on Theory of Computation?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Theory of Computation