Upper Bound on the Products of Particle Interactions in Cellular Automata
Particle-like objects are observed to propagate and interact in many spatially extended dynamical systems. For one of the simplest classes of such systems, one-dimensional cellular automata, we establish a rigorous upper bound on the number of distinct products that these interactions can generate. The upper bound is controlled by the structural complexity of the interacting particles -- a quantity which is defined here and which measures the amount of spatio-temporal information that a particle stores. Along the way we establish a number of properties of domains and particles that follow from the computational mechanics analysis of cellular automata; thereby eludicating why that approach is of general utility. The upper bound is tested against several relatively complex domain-particle cellular automata and found to be tight. PACS: 45.70.Qj, 05.45, 05.65+b
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||Sep 2000|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://www.santafe.edu/sfi/publications/working-papers.html
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:wop:safiwp:00-09-052. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel)
If references are entirely missing, you can add them using this form.