Chapter 5: Two Dimensions and Beyond

Section 3: Turing Machines

2D mobile automata

Mobile automata can be generalized just like Turing machines. Even in the simplest case, however, with only four neighbors involved there are already (4k)^(k^5) possible rules, or nearly 10^29 even for k=2.

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