Computer Science · Theory of Computation
Which of the following statements is INCORRECT? (i) A language L is recursively enumerable if there exists a Turing machine that accepts L. (ii) For k ≥ 1, a k-tape Turing machine cannot be simulated by an equivalent single-tape Turing machine. (iii) Every computational process that can be considered an algorithm can be computed by a Turing machine.
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1(i) only
- 2(ii) only✓
- 3(iii) only
- 4(i) and (ii) only
Correct answer
(ii) 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