Chapter 11 Notes > Section 12

	Notes for Chapter 11: The Notion of Computation Section 12: Universality in Turing Machines and Other Systems Minsky's [universal] Turing machine History [of universal Turing machines] Rule 110 Turing machines Rule 60 Turing machines Turing machine enumeration States versus colors [in Turing machines] s=2, k=2 Turing machines [Turing] machine 596440 s=3, k=2 Turing machines [Universal] tag systems [Methods of] encoding sequences by integers [Universal] register machines [Universal] recursive functions Lambda calculus Combinators Combinator properties Single [universal] combinators Cellular automaton combinators Testing universality [in symbolic systems] Criteria for universality [Universality for] classes of systems PAGE IMAGES RELATED LINKS Main text from section Downloadable programs for this section Downloadable images Search Forum for this section Post a comment NKS | Online FAQs

From Stephen Wolfram: A New Kind of Science [citation]