Automata.sea.hqx

                         Cellular Automata
                            Ken Wessen
                       Department of Physics
                   Prince of Songkla University
                         Hat-Yai, Songkla
                          Thailand 90112
                      ken@sritrang.psu.ac.th

From the author's description: " A cellular automata consists of a lattice
of 'sites', each of which can take on a discrete value.  The automata then
evolves according to a 'rule', which determines the value of the site
after the next iteration (time step).  In this program, only 'totalistic'
rules are employed, i.e. the next state is determined simply by the sum 
of the values of the state itself, plus all neighbors in a given range.  
Non-totalistic rules, where a distinction is made between configurations
012, 030, and 111 for example, are not implemented, because of the
difficulty in expressing the rule in such cases (even a three value,
nearest neighbor non-totalistic cellular aautomata requires a rule
expressed as a 27 digit ternary number)."

The user can set the rules in several different ways.  The computer
randomly determines the initial values.  Then the program fills the screen
based on those values and the rules set.

There is online documentation.

The program does not require FPU, and it runs on older macs as well as
PowerMacs.  It appears to be 32 bit clean. Testing was done using sys7.1.

--------------------------------------------------------------

Location in Mathematics Archives:
     Anonymous FTP:
        /mac/discreteMath
        /mac/lifeSciences

     Gopher:
       (First select "Software" then "Macintosh software arranged
        by subjects")
        Discrete Math / Cellular Automata
        Life Sciences / Cellular Automata

--------------------------------------------------------------