Upper Bound on the Products of Particle Interactions in Cellular Automata

Nonlinear Sciences – Cellular Automata and Lattice Gases

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

17 pages, 12 figures, 3 tables, http://www.santafe.edu/projects/CompMech/papers/ub.html V2: References and accompanying text

Scientific paper

10.1016/S0167-2789(01)00252-4

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 elucidating 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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Upper Bound on the Products of Particle Interactions in Cellular Automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Upper Bound on the Products of Particle Interactions in Cellular Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Upper Bound on the Products of Particle Interactions in Cellular Automata will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-607801

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.