KnowraRice's theoremLinked fromLinked fromThe 17 pages that link to Rice's theorem, each with the reason it gives.All 17Broader topic 1Related 13Compared with 3Halting problemRelated: It generalizes the halting problem to broad properties of program behavior.Church–Turing thesisRelated: It demonstrates the reach of computability results once the model is fixed.Computability theoryRelated: It extends the halting problem to broad classes of questions about program behavior.Decision problemRelated: It proves broad limits on deciding properties of program behavior.Computable functionRelated: It shows that broad questions about what computed functions do cannot be algorithmically settled.Many-one reductionRelated: Its proof uses reductions to establish undecidability across program properties.Universal Turing machineRelated: The universal model makes broad limits on program analysis precise.DiagonalizationRelated: Its proof uses self-reference and diagonal reasoning to rule out general program analyzers.Undecidable problemBroader topic: It extends undecidability from halting to broad classes of program-behavior questions.Arithmetical hierarchyRelated: Many such properties are expressible at low levels of the hierarchy despite undecidability.Myhill–Nerode theoremCompared with: It marks a limit beyond regular languages, where broad behavioral properties become undecidable.Kleene's recursion theoremRelated: Fixed-point reasoning provides a standard route to proving Rice-style undecidability results.Computable setCompared with: It identifies broad limits on deciding program-defined sets, unlike sets with total decision procedures.Computably enumerable setRelated: It shows why many questions about enumerated program behaviors cannot be decided.Post's theoremCompared with: It illustrates undecidability through program properties rather than hierarchy-jump equivalences.S-m-n theoremRelated: Its standard proof uses effective program transformations enabled by parameterization.Turing's proofRelated: It extends the lesson that general facts about program behavior resist algorithmic decision.
KnowraRice's theoremLinked fromLinked fromThe 17 pages that link to Rice's theorem, each with the reason it gives.All 17Broader topic 1Related 13Compared with 3Halting problemRelated: It generalizes the halting problem to broad properties of program behavior.Church–Turing thesisRelated: It demonstrates the reach of computability results once the model is fixed.Computability theoryRelated: It extends the halting problem to broad classes of questions about program behavior.Decision problemRelated: It proves broad limits on deciding properties of program behavior.Computable functionRelated: It shows that broad questions about what computed functions do cannot be algorithmically settled.Many-one reductionRelated: Its proof uses reductions to establish undecidability across program properties.Universal Turing machineRelated: The universal model makes broad limits on program analysis precise.DiagonalizationRelated: Its proof uses self-reference and diagonal reasoning to rule out general program analyzers.Undecidable problemBroader topic: It extends undecidability from halting to broad classes of program-behavior questions.Arithmetical hierarchyRelated: Many such properties are expressible at low levels of the hierarchy despite undecidability.Myhill–Nerode theoremCompared with: It marks a limit beyond regular languages, where broad behavioral properties become undecidable.Kleene's recursion theoremRelated: Fixed-point reasoning provides a standard route to proving Rice-style undecidability results.Computable setCompared with: It identifies broad limits on deciding program-defined sets, unlike sets with total decision procedures.Computably enumerable setRelated: It shows why many questions about enumerated program behaviors cannot be decided.Post's theoremCompared with: It illustrates undecidability through program properties rather than hierarchy-jump equivalences.S-m-n theoremRelated: Its standard proof uses effective program transformations enabled by parameterization.Turing's proofRelated: It extends the lesson that general facts about program behavior resist algorithmic decision.