Notes
Chapter 11: The Notion of Computation
Efficiency of computations [in cellular automata]
Minimal [cellular automaton] programs for sequences
Other examples [of cellular automaton computation]
Random initial conditions [for squaring and primes CAs]
Continuous systems [from cellular automata]
Logic circuits [from cellular automata]
Mobile automata [from cellular automata]
Multiplication systems [from cellular automata]
RAM [emulated with cellular automata]
Register machines [from cellular automata]
Sequential substitution systems [from cellular automata]
Arithmetic systems [emulating register machines]
Computations with register machines
Cyclic tag systems [emulating tag systems]
History [of arithmetic system emulation]
Mobile automata [emulating cellular automata]
Multicolor Turing machines [from 2-color TMs]
One-element-dependence tag systems [emulating TMs]
Register machines [emulating Turing machines]
Register machines with many registers [from 2 registers]
Sequential substitution systems [emulating cellular automata]
Symbolic systems [emulating cellular automata]
[Cellular automaton] rule emulations
Claims of non-universality [in cellular automata]
Encodings [of cellular automaton rules]
Cellular automaton combinators
History [of universal Turing machines]
[Methods of] encoding sequences by integers
Minsky's [universal] Turing machine
Single [universal] combinators
States versus colors [in Turing machines]
Testing universality [in symbolic systems]