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?
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?
Source: Wikipedia "Rice's theorem" · CC BY-SA 4.0
Share this article: X · Bluesky