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