theorem 3.97 Rice

open in the book · parts/02-mathematical-methods/01-logic-sets.tex:2820 · p. 52

Rests on

Supports

Nothing declares a dependency on this node yet.

Neighborhood

Every logical edge within two steps of this node.

theorem 3.97: Rice3.97definition 3.93: Computable function, decidable set3.93theorem 3.96: Turing3.96theorem 3.95: Universal machine3.95proof : ch:01-logic-sets@proof-24proofdefinition 3.92: Turing machine3.92proposition A.15: Syntax is computableA.15theorem A.17: RepresentabilityA.17theorem 3.98: Church–Turing3.98theorem A.30: Church, TuringA.30proof : ch:01-logic-sets@proof-23proofproof : ch:01-logic-sets@prooflink-4proof

Edges

typedirectionnode provenancewhere
depends_on Computable function, decidable set declared parts/02-mathematical-methods/01-logic-sets.tex:2825
depends_on Turing declared parts/02-mathematical-methods/01-logic-sets.tex:2825
depends_on Universal machine declared parts/02-mathematical-methods/01-logic-sets.tex:2825
proves ch:01-logic-sets@proof-24 declared parts/02-mathematical-methods/01-logic-sets.tex:2828