Cellular Automata question
- To: mathgroup at smc.vnet.net
- Subject: [mg17465] Cellular Automata question
- From: "Seth Chandler" <SChandler at uh.edu>
- Date: Sun, 9 May 1999 04:44:00 -0400
- Organization: University of Houston
- Sender: owner-wri-mathgroup at wolfram.com
This is slightly off topic for the Mathematica group, but I am hoping someone in this newsgroup can help? If one has a two dimensional cellular automaton in which site can take on two values (0 or 1) but in which the future value depends on all sites within a radius of 2, i.e. on 25 sites. There are 2^(2^(25)) possible update rules. (This is a really, really big number) Suppose, however, that one can constrain the update rules so that if m is the 5 x 5 neighborhood of a site, the outcome of the update procedure is the same for m, and m rotated 90 degrees, 180 degrees and 270 degrees clockwise. Now how many possible update rules are there?