theorem 3.98 Church–Turing

open in the book · parts/02-mathematical-methods/01-logic-sets.tex:2859 · 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.98: Church–Turing3.98definition 3.93: Computable function, decidable set3.93definition 3.80: Formal system3.80theorem 3.96: Turing3.96proof : ch:01-logic-sets@prooflink-5proofdefinition 3.92: Turing machine3.92proposition A.15: Syntax is computableA.15theorem A.17: RepresentabilityA.17theorem 3.97: Rice3.97theorem 3.95: Universal machine3.95definition A.16: RepresentabilityA.16definition 3.82: Consistency, completeness, soundness3.82definition 3.81: Effective axiomatization3.81definition 3.83: Peano arithmetic3.83lemma 3.86: Diagonal lemma3.86theorem 3.84: Gödel's completeness theorem, 19303.84theorem A.30: Church, TuringA.30proof : ch:01-logic-sets@proof-23proof

Edges

typedirectionnode provenancewhere
cites A Note on the Entscheidungsproblem derived parts/02-mathematical-methods/01-logic-sets.tex:2862
cites On Computable Numbers, with an Application to the Entscheidungsproblem derived parts/02-mathematical-methods/01-logic-sets.tex:2862
depends_on Computable function, decidable set declared parts/02-mathematical-methods/01-logic-sets.tex:2863
depends_on Formal system declared parts/02-mathematical-methods/01-logic-sets.tex:2863
depends_on Turing declared parts/02-mathematical-methods/01-logic-sets.tex:2863
proves ch:01-logic-sets@prooflink-5 declared parts/02-mathematical-methods/01-logic-sets.tex:2865