From: bartlett@memstvx1.memst.edu
Date: Fri Apr 23 1993 - 20:01:29 UTC
>From: ken@cs.uiuc.edu (Kenneth C Schalk)
>Subject:CAs with non-global rules
>Date: Tue, 20 Apr 1993 14:31:11 GMT
>Message-ID:<C5sDo4.Ho7@cs.uiuc.edu>
> Recently I've considering a project which I first came up with
>several years ago and I was wondering if anything akin to it has ever
>been done. The idea I had was to make a cellular automaton with local
>rather than global rules. Bascially, every cell would have it's own set
>of rules consisting of conditions to be tested and actions to be taken
>if those conditions were met.
Sort of. When each cell has a different rule, the resulting CA is
called "inhomogeneous".
See:
Vichniac, Tamayo and Hartman: "Annealed and quenched inhomogeneous
cellular automata" Journal of Statistical Physics 45, (1986)
Hartman and Vichniac: "Inhomogenous cellular automata" Disordered
Systems and Biological Organization, Bienenstock, E. et al (Eds.)
Aleksic, Zoran: "Computatoin in Inhomogenous Celluar Automata"
in Complex Systems: From Biology to Computation, David Green and
Terry Bossomaier, IOS Press, Amsterdam (1993)
The last reference can be gotten by anonymous ftp:
ftp life.anu.edu.au
ftp> cd /pub/complex_systems/anu92/papers
ftp> binary
ftp> get aleksic.ps
ftp> bye
Then you need to laser-print the postscript file fo course.
Happy hunting.
Ron Bartlett
Mathematics
Memphis State University
--Boundary (ID WiwMtrltVKz/99d7fuUBLQ)--
This archive was generated by hypermail 2.1.7 : Tue Oct 14 2003 - 21:44:12 UTC