Which of the following are correct statements?
(a) TMs that always halt are known as Decidable problems
(b) TMs that are guaranteed to halt only on acceptance are recursive ennumerable.
(c) Both (a) and (b)
(d) None of the mentioned
The question was asked by my school teacher while I was bunking the class.
Query is from The Diagonalization Languages topic in section Undecidability of Automata Theory