Technical Reports

The ICICS/CS Reading Room


UBC CS TR-92-08 Summary

Symmetry in Self-Correcting Cellular Automata, April 1992 Nicholas Pippenger, 11 pages

We study a class of cellular automata that are capable of correcting finite configurations of errors within a finite amount of time. Subject to certain natural conditions, we determine the geometric symmetries such automata may possess. In three dimensions the answer is particularly simple: such an automaton may be invariant under all proper rotations that leave the underlying lattice invariant, but cannot be invariant under the inversion that takes each configuration into its mirror image.


If you have any questions or comments regarding this page please send mail to help@cs.ubc.ca.