definition 3.92 Turing machine

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

Rests on

No declared or derived dependency edges point away from this node yet.

Supports

Neighborhood

Every logical edge within two steps of this node.

definition 3.92: Turing machine3.92definition A.31: k-tape machineA.31definition 3.93: Computable function, decidable set3.93lemma A.32: Tape reductionA.32theorem A.33: thm:app-univ-universalA.33theorem 3.96: Turing3.96theorem 3.95: Universal machine3.95proposition A.15: Syntax is computableA.15theorem A.17: RepresentabilityA.17theorem 3.98: Church–Turing3.98theorem 3.97: Rice3.97proof : app:A-long-proofs@proof-25proofequation A.145: eq:app-univ-codeA.145proof : app:A-long-proofs@proof-26prooftheorem A.30: Church, TuringA.30proof : ch:01-logic-sets@proof-23proofproof : ch:01-logic-sets@prooflink-4proof

Edges

typedirectionnode provenancewhere
depends_on $k$-tape machine declared appendices/A-long-proofs.tex:2708
depends_on Computable function, decidable set declared parts/02-mathematical-methods/01-logic-sets.tex:2736
depends_on Tape reduction declared appendices/A-long-proofs.tex:2715
depends_on thm:app-univ-universal declared appendices/A-long-proofs.tex:2773
depends_on Turing declared parts/02-mathematical-methods/01-logic-sets.tex:2783
depends_on Universal machine declared parts/02-mathematical-methods/01-logic-sets.tex:2766