Rice's Theorem

A theorem in computability theory asserting that every nontrivial semantic property of the language recognized by a Turing machine is undecidable: no algorithm can decide, for an arbitrary Turing machine, whether the language it accepts has that property, provided the property depends only on the language and is nontrivial.