Rice's theorem

Rice's theorem is a fundamental result in computability theory that addresses the limits of what can be determined about the behavior of Turing machines and languages recognized by them. Specifically, the theorem states that any non-trivial property of the languages recognized by Turing machines is undecidable.