Rice Theorem

If a language is Semantic, it's either Trivial or undecidable!

• If it's trivial -> it's decidable
• if it's non trivial -> it's non decidable

Translation: if a language cares about the behavior of programs, it's undecidable

It does not work on non-semantic (syntactic) languages!
Also note that trivial languages are always decidable