theorem 3.95 Universal machine

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

Rests on

Supports

  • depends_on theorem 3.97 Rice

Neighborhood

Every logical edge within two steps of this node.

theorem 3.95: Universal machine3.95definition 3.93: Computable function, decidable set3.93definition 3.92: Turing machine3.92theorem 3.97: Rice3.97proof : ch:01-logic-sets@prooflink-4proofproposition A.15: Syntax is computableA.15theorem A.17: RepresentabilityA.17theorem 3.98: Church–Turing3.98theorem 3.96: Turing3.96definition A.31: k-tape machineA.31lemma A.32: Tape reductionA.32theorem A.33: thm:app-univ-universalA.33proof : ch:01-logic-sets@proof-24proof

Edges

typedirectionnode provenancewhere
depends_on Computable function, decidable set declared parts/02-mathematical-methods/01-logic-sets.tex:2766
depends_on Turing machine declared parts/02-mathematical-methods/01-logic-sets.tex:2766
depends_on Rice declared parts/02-mathematical-methods/01-logic-sets.tex:2825
proves ch:01-logic-sets@prooflink-4 declared parts/02-mathematical-methods/01-logic-sets.tex:2768