Cellular Automata as Simple Self-Organizing Systems (1982)

Note

(1) Reversible cellular automata may nevertheless be constructed, for example by allowing a configuration to be determined by two previous configurations, in analogy with the finite difference form of a second-order differential equation in time (E. Fredkin and N. Margolus, private communication).