$ f(M) = \left\{\begin{array}{ll} 1 & M \text{ does not terminate for every input } \\ 0 & \text{otherwise} \end{array}\right.$
Reading Rice's Theorem
Proposition (Rice):
Let $ \mathcal{C} \subseteq RE$ . Given a Turing Machine $ M$ , we ask: “The problem accepted by $ M$ is in $ \mathcal{C}$ ?”. Answering this question is not in $ R$ (not decidable).
Rice's theorem establishes undecidability of a problem. Which problem is that?
What does this result entail?
Examine the transformation from the lecture, and prove both directions by yourself.