Computer Science · Theory of Computation
यदि कोई ट्यूरिंग मशीन M मौजूद है, जो 'हां' उत्तर वाली किसी निर्णय समस्या के दिए जाने पर समाप्त होती है, लेकिन 'नहीं' उत्तर के लिए अनिश्चित काल तक चल सकती है, तो उस समस्या को ____________ कहा जाता है।
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1अनिर्णायक (Undecidable)
- 2आंशिक रूप से हल योग्य (Partially solvable / Semi-decidable)✓
- 3अहल (Unsolvable)
- 4निर्णायक (Decidable)
सही उत्तर देखें
आंशिक रूप से हल योग्य (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
Preparing for Computer Science?
Practice full-length Computer Science 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