Rice's theorem

Theorem in computability theory

In computability theory, Rice's theorem states that all non-trivial semantic properties of programs are undecidable. A semantic property is one about the program's behavior (for instance, "does the program terminate for all inputs?"), unlike a syntactic property (for instance, "does the program contain an if-then-else statement?"). A non-trivial property is one that is neither true for every program, nor false for every program.

From Wikipedia, under CC BY-SA. More on occurri.