Recurring States in Cellular Automaton Evolution

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram CDF Player or other Wolfram Language products.

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

It is possible to plot the amount of recurrent states in the evolution of cellular automaton (CA), with random initial condition. The steps are sorted, converted to an integer from the binary sequence, and plotted as a sequence of values. There are more recurrences of steps at CA classes I and II than classes III and IV, which have less recurrences because of their random (noisy) characteristics.

Contributed by: Daniel de Souza Carvalho (March 2011)
Open content licensed under CC BY-NC-SA


Snapshots


Details

detailSectionParagraph


Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.
Send