home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.theory.cell-automata
- Path: sparky!uunet!usc!howland.reston.ans.net!paladin.american.edu!gatech!enterpoop.mit.edu!bloom-beacon!INTERNET!dont-send-mail-to-path-lines
- From: rucker@sjsumcs.SJSU.EDU (Rudy Rucker)
- Subject: RE: "A dude...!"
- Message-ID: <199301090349.AA21247@sjsumcs.SJSU.EDU>
- Sender: root@athena.mit.edu (Wizard A. Root)
- Organization: The Internet
- Distribution: inet
- Date: Sat, 9 Jan 1993 03:49:57 GMT
- Lines: 23
-
-
- There should be a software method for simple access to a FAQ (frequently
- asked question) list such as "What is a CA?"
-
- But I'll try an answer. A CA (cellular automaton) is a *parallel* computation
- characterized by being i) homogeneous (each of the parallel processors
- has the same data-intake pattern, the same algorithm, and the same data-output
- channel) ii) parallel (meaning that there are lots of the processing or
- computing sites. Ordinarily "parallel" is taken to mean "synchronistic"
- as well,menaing that all the parallel sites update at the same times.
- Everybody inhales, everybody thinks, everybody exhales.) iii) local
- ( the data-intake, or inhale, only draws information from a finite number
- of other processors in the CA).
-
- This definition appear in Margolus and Toffoli's CELLULAR AUTOMATON
- MACHINES and in my CA LAB MANUAL.
-
- I'm not entirely sure its the best possible definition.
-
- One assumption implicit in the ordinary idea of a CA is that the sites
- stay spatially fixed. Something I wonder about is whether a moving
- alife program such as vants, turmites, sims, critters, bugs etc. might
- not also be thought of as a CA in a general sense.
-