Awesome q2a theme
0 votes
3 views

Let X be defined as follows:

X: Given M an encoding of a Turing Machine. Does M halt on all inputs?

Which of the following is true?

  1. X is decidable
  2. X is undecidable but partially decidable
  3. X is undecidable and not even partially decidable
  4. X is not a decidable problem

Please answer with explaination.

in Theory of Computation by (14 points) | 3 views

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users Jun 2020
  1. vps123

    4 Points

  2. ummokkate

    1 Points

  3. Kushagra गुप्ता

    1 Points

  4. faseela45

    1 Points

  5. srestha

    1 Points

7,385 questions
1,744 answers
10,702 comments
90,357 users