Recurring States in Cellular Automaton Evolution
Requires a Wolfram Notebook System
Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.
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
"Recurring States in Cellular Automaton Evolution"
Wolfram Demonstrations Project
Published: March 7 2011