Rice–Shapiro theorem

The Rice–Shapiro theorem, often referred to as Rice's theorem in the context of computability theory, is a fundamental result concerning the properties of recursively enumerable (r.e.) sets and the functions computable by Turing machines. In its standard form, Rice's theorem states that any non-trivial property of the languages recognized by Turing machines is undecidable.