Rice's_theorem?useskin=vector

Couldn't find lead section for Rice's_theorem?useskin=vector

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. The theorem generalizes the undecidability of the halting problem. It has far-reaching implications on the feasibility of static analysis of programs. It implies…

saved by

• Rishi Kothari

related reading

• Curry–Howard correspondenceen.wikipedia.org
• Gödel's incompleteness theorems - Wikipediaen.wikipedia.org
• Halting problem - Wikipediaen.wikipedia.org
• A shallow dive into formal verificationvitalik.eth.limo
• Type theory - Wikipediaen.wikipedia.org
• Working through a small tiling result — LessWronglesswrong.com
• Kleene's recursion theorem - Wikipediaen.wikipedia.org
• Turing's proofen.wikipedia.org
• Definability of Truth in Probabilistic Logic - Christiano 2013intelligence.org
• Montague Semantics (Stanford Encyclopedia of Philosophy)plato.stanford.edu
• A Theory That Proves Its Own Inconsistency · Yan Sheng's siteangyansheng.github.io
• The Church-Turing Thesis (Stanford Encyclopedia of Philosophy)plato.stanford.edu