Which of the following is true for The Halting problem?
(a) It is recursively ennumerable
(b) It is undecidable
(c) Both (a) and (b)
(d) None of the mentioned
The question was asked in an internship interview.
Asked question is from The Diagonalization Languages in division Undecidability of Automata Theory