Notes

Chapter 11: The Notion of Computation


Section 12: Universality in Turing Machines and Other Systems

Cellular automaton combinators Combinator properties Combinators Criteria for universality History [of universal Turing machines] Lambda calculus [Methods of] encoding sequences by integers Minsky's [universal] Turing machine Rule 110 Turing machines Rule 60 Turing machines s=2, k=2 Turing machines s=3, k=2 Turing machines Single [universal] combinators States versus colors [in Turing machines] Testing universality [in symbolic systems] [Turing] machine 596440 Turing machine enumeration [Universal] recursive functions [Universal] register machines [Universal] tag systems [Universality for] classes of systems

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