Linked from

The 17 pages that link to Rice's theorem, each with the reason it gives.

• Halting 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.

• Arithmetical hierarchyRelated: Many such properties are expressible at low levels of the hierarchy despite undecidability.

• Kleene's recursion theoremRelated: Fixed-point reasoning provides a standard route to proving Rice-style undecidability results.

• Computably enumerable setRelated: It shows why many questions about enumerated program behaviors cannot be decided.

• 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.