The rule is described in The Armchair Universe by A.K. Dewdney, p. 24.
It's a simple rule: the cell becomes "alive" iff the number of living neighbors
is odd. (Assuming cells are represented as 0 and 1, you can write c = sum(c,N)
neighborhood, Fredkin's rule has the fascinating property that any initial
pattern is replicated several times on a larger scale. If you're using four
neighbors (rectangular orthogonal), you get four copies of the initial starting
pattern, then 16, then 64, and so on, every so many ticks. It works for
neighborhood sizes of 6 and 8, too.

The first paper on the Gacs rule was published in Problems of Transmission of
Information, in 1978. The Russian journal has been translated into English.
There are two co-authors, Kurdyumov and Levin.

HODGE-C is a (`mostly ANSI') C language implementation of Gerhard &
Schuster's hodge-podge machine. It implements a class of cellular automata, that
resemble very closely autocatalytic chemical reactions, like for example, the
Belousov-Zhabotinskii (BZ) reaction. It's available via anonymous ftp from HODGE

John N. Rachlin <rachlin@cs.jhu.edu> Charles F. Wells
<cfw2@po.CWRU.Edu> A Fraser
<A.Fraser@eee.salford.ac.uk> Rudy Rucker
<rucker@jupiter.SJSU.EDU>

The Vant rule, by Chris Langton, describes the path of an ant who starts
pointing in a certain direction. If the ant is on a non-white square it turns
the square red, rotates 90 degrees clockwise and moves one pixel in the
direction it is pointing. If it is on a red square it turns the square white,
rotates 90 degrees counterclockwise and moves one pixel in the direction it is
pointing.

A generalization of Lanton's Ant can be found in Rudy Rucker, ARTIFICIAL LIFE
LAB, Waite Group Press.

There were also some articles about Lanton's Ant in Dewdney's magazine
Algorithm, and I believe there was an article in The Mathematical Intelligencer.
Langton's original article in the reference cited by Dewdney is well worth
looking up.

description: This program is based on "Langton's Automaton" and demonstrates
the complex patterns of one or more "ants" moving according to simple
user-defined rules.

requirements: This Program was written in Turbo Pascal, ver. 6.0 and Turbo C
2.0 It requires EGA or VGA graphics. An executable is available from the author.

Description: This program implements Chris Langton's cellular automaton [unk93]

requirements: This is a QBasic program that can be run on any DOS machine
with VGA graphics. It was written by Charles Wells, Department of Mathematics,
Case Western Reserve University, Cleveland, OH 44106-7058, USA.
<cfw2@po.cwru.edu.>

Borland C port
of above by <A.Fraser@eee.salford.ac.uk>.

A generalization of Lanton's Ant can be found in Rudy Rucker, ARTIFICIAL LIFE
LAB, Waite Group Press.

What is known about Hexagonal CA?

Contributions by:

Charles Herring <herring@pike.cecer.army.mil>Herring McIntosh Harold
V.-UAP <mcintosh@redvax1.dgsca.unam.mx><gaylord@ux1.cso.uiuc.edu> richard j. gaylord

For a C++ / unix/X computer program, see:
Hex Prog
The source code is available
Hex FTP

Gaylord: I've written a CA which treats the hexagonal lattice as a
distorted square lattice and i've used it to implement the snowflake formation
model of Packard in Mathematica.

Kendall Preston, Jr. and Michael J. B. Duff, Modern Cellular
Automata, Plenum Press, New York, 1984 (ISBN 0-306-41737-5).

These authors were mostly interested in filtering and sharpening digital
images, but there are a couple of chapters on more general automata. In
particular, they found some rules with gliders, and quite a few with
oscillators. However, nobody seems to have yet found a rule with glider guns, so
that it is hard to go on and get the other constructions which make Life
interesting.

Piotr Berman and Janos Simon. Investigations of fault-tolerant networks of
computers. In Proc. of the 20-th Annual ACM Symp. on the Theory of
Computing, pages 66-77, 1988.