Recurring States in Cellular Automaton Evolution

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.

comments
 
Powered by Wolfram Mathematica
Give us your feedback
Give us your feedback

Source page:




 often  occasionally  never

Note: Please do not include anything you consider confidential or proprietary. Your message and contact information may be shared with the author of any specific Demonstration for which you give feedback, but will not otherwise be published or distributed.
Privacy Policy »

Note: To run this Demonstration you need the free
Mathematica Player
or Mathematica 7+
Download or upgrade to Mathematica Player 7
I already have Mathematica Player or Mathematica 7+