Computer Science · Theory of Computation
If there exists a Turing machine M which terminates when given an instance of a decision problem with a 'yes' answer, but may loop infinitely for a 'no' answer, the problem is said to be ____________.
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Undecidable
- 2Partially solvable (Semi-decidable)✓
- 3Unsolvable
- 4Decidable
Correct answer
Partially solvable (Semi-decidable)
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