Coupled Map Lattices (CML) are like CA in that they operate in discrete time
on discrete lattices. Each cell, however, supports a continuous variable. CML
were introduced by Kuni Kaneko, who has extensively investigated their
A good starting point for applications is Ray
Kapral's work. He, together with Kaneko, started this
field. I would recommend Ray's reviews explaining
relationships between: CA, CML, LGCA in simulation of
complex chemical reactions.
Along the same subject there are a lot of papers published in physics
journals. Another node where one can gather information on this subject is at Bruxelles group
For a related study, with software for Windows, see Rudy Rucker's
What is the iterated prisoner's dilemma?
Patrick Tufts <email@example.com>
Iterated Prisoner's Dilemma and the Evolution Of Non-Mutual Cooperation', by
Peter Angeline (firstname.lastname@example.org).
Other good sources for Prisoner's Dilemma papers are the two Simulations of
Adaptive Behavior proceedings, otherwise known as "From Animals to Animats"
volumes 1 and 2.
What are Cellular Neural Nets?
Contributions by: Frank Puffer
A CNN is practically a CA with continuous states that may be disrete or
continuous in time.
Contributions by: Bruce MacLennan <email@example.com>
A continuous spatial automaton is analogous to a cellular automaton, except
that the cells form a continuum, as do the possible states of the cells. After
an informal mathematical description of spatial automata, we describe in detail
a continuous analog of Conway's ``Life,'' and show how the automaton can be
implemented using the basic operations of field computation.
Really interesting work, describing 14(!) classes of fuzzy cellular automata
and their hierarchy (but are there any related applications??): 
These articles are (let me say) ,,young`` (1991 and 1994), but the roots seem
to be ,,very old``: [San68],
What are Movable Finite Automata?
Thomas Worsch <firstname.lastname@example.org>
Movable Finite Automata is one name given to systems with entities which move
about a fixed lattice.
Perhaps the first one to consider such a model was Armin Hemmerling. He
called the model ``system of Turing automata'': there is a d-dimensional tape on
which finite automata can move around and read and write the tape squares. The
is in German, but you can also have a look at [Hem79a].
Overviews on relationship be CA and other systems?
Dave Demaris <email@example.com>
Demaris Master's thesis
(postscript) treats the intersection of the topic areas: neural nets,
neuroscience, nonlinear dynamics, cellular automata, coupled map lattices,
cellular neural networks.
Are there any implementations of CA on quasicrystals?
Contributions by: David Ardell <ardell@charles.Stanford.EDU>
<firstname.lastname@example.org> BAUJARD Olivier
We have implemented a few majority rules on Penrose tilings.
Relevant links can be found
Zoran Aleksic. Computation in inhomogenous celluar automata. In David
Green and Terry Bossomaier, editors, Complex Systems: From Biology to
Computation. IOS Press, Amsterdam, 1993. anonymous ftp life.anu.edu.au:
Armin Hemmerling. Concentration of multidimensional tape-bounded systems
of Turing automata and cellular spaces. In L. Budach, editor, Fundamentals
of Computation Theory, pages 167-174, Berlin, 1979. Akademie-Verlag.
Andrew Wuensche. The ghost in the machine:basins of attraction of random
boolean networks. Cognitive Science Research Paper 281, University of
Sussex, 1993, 1993. to be published in Artificial Life III, Santa Fe
Institute Studies in the Sciences of Complexity.