The Cellular Automaton

A time-reversible cellular automaton can most easily be described by regarding its evolution law as a two-step process, for instance by first allowing the even sites to update, then the odd sites. The discrete Hamiltonian operator procedure of Chap. 19 may be used. Subsequently, we apply a perturbative algebra, starting from the Baker Campbell Hausdorff expansion.