Definition of "CA"

BTW: Of course the rules were parametrised, so any totalistic 2-dimensional 9-neighbourhood CA could be run.

1989 March 21, Mark Kramer, “Fast LIFE (was: Re: summing 9-cell neighborhoods)”, in comp.theory.cell-automata‎ (Usenet)

The new CA is a modification of Fredkin's earlier SALT architecture in which every cell is identified as either even or odd - as in sodium and chlorine in a salt crystal hence the name. The state of each cell is either up or down and the development rule simple takes account of states of odd and even neighbours. The up-date at each time step simply takes the form of a swap of the states of diagonally related cells. SALT CAs are reversible and capable of universal computation and are conjectured to be capable of universal construction in the sense of Von Neumann.

2012 July 3, Mike James, “A New Computational Universe - Fredkin's SALT CA”, in www.i-programmer.info‎, retrieved 2012-10-25

I assume we are speaking of a single rule CA (one rule for every cell).

2013 October 31, Shawn LeGrand, “Question about one-dimensional cellular automaton with a finite number of cells”, in comp.theory.cell-automata‎ (Usenet)

Well-designed CAs will create a trust hierarchy, which consists of a root with a number of subroots, to further enhance protection of the private key.

2003, Kapil Raina, PKI Security Solutions for the Enterprise, page 30