9722

Order, Chaos, and the Formation of a Cantor Set Attractor in Elementary Cellular Automata

Consider finite elementary cellular automata (ECA) of size 10. All possible binary vectors of length 10 form a complete set of initial conditions (CSIC). Every step of an ECA evolution maps this set to itself, and a particular initial condition starts a trajectory in time consisting of a sequence of binary states [1]. This Demonstration uses flow diagrams to visualize the trajectories of all 1024 initial conditions over five steps of evolution of an ECA.
To construct a flow chart, first index all initial conditions by integers in binary or with a Gray code. After one step of the ECA evolution, each index is mapped to another index from the same set. Place the previous step indices on the top horizontal line and the next step indices on the bottom horizontal line. Then connect each index and its mapped counterpart with a spline line. The whole procedure is repeated for the five steps of the evolution of the ECA, thus giving five flow diagrams.
The diagrams can be stacked on top of each other to show the evolution of indices in time, running vertically from top to bottom. Or the diagrams can be made translucent and overlaid so the most frequent mappings will be more apparent and dense. In this case, coloring shows a clearer mapping between different index domains.
For most of the ECA rules we observe "thinning" of CSIC [1, 2], which reflects on ordering, self-organization, and the formation of a Cantor set attractor in the limit [1–5] as the ECA size tends to infinity. Set "Gray" and "stacked" to observe quick divergence of the initially narrow bundle of red trajectories [1] and their redistribution over all indices, especially for the type-3 rules. This indicates chaotic behavior [1, 3]. Gray code ordering is most useful in this case, because it makes initial conditions in the red bundle structurally close. More precisely, two neighboring initial conditions differ only by a unit Hamming distance.
Browse the bookmarks and snapshots for interesting cases. The phenomenon shown here manifests more clearly with increasing ECA size, but this takes more time to compute.

SNAPSHOTS

  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.









 
RELATED RESOURCES
Mathematica »
The #1 tool for creating Demonstrations
and anything technical.
Wolfram|Alpha »
Explore anything with the first
computational knowledge engine.
MathWorld »
The web's most extensive
mathematics resource.
Course Assistant Apps »
An app for every course—
right in the palm of your hand.
Wolfram Blog »
Read our views on math,
science, and technology.
Computable Document Format »
The format that makes Demonstrations
(and any information) easy to share and
interact with.
STEM Initiative »
Programs & resources for
educators, schools & students.
Computerbasedmath.org »
Join the initiative for modernizing
math education.
Step-by-step Solutions »
Walk through homework problems one step at a time, with hints to help along the way.
Wolfram Problem Generator »
Unlimited random practice problems and answers with built-in Step-by-step solutions. Practice online or make a printable study sheet.
Wolfram Language »
Knowledge-based programming for everyone.
Powered by Wolfram Mathematica © 2014 Wolfram Demonstrations Project & Contributors  |  Terms of Use  |  Privacy Policy  |  RSS Give us your feedback
Note: To run this Demonstration you need Mathematica 7+ or the free Mathematica Player 7EX
Download or upgrade to Mathematica Player 7EX
I already have Mathematica Player or Mathematica 7+