Rice's theorem and the arithmetical hierarchy
Rice's Theorem states that all non-trivial semantic properties of programs are undecidable.
📜
The statement of the theorem
Let be a non-trivial set of computable functions. The problem of deciding if a given program computes a function in is undecidable.
Source: Wikipedia