Cellular Automata Entropy

The entropy of a list is defined by , summing over the elements of . and are the probabilities of black and white cells, respectively. The initial condition is a finite list of random bits.
The entropy can be used to study the amount of information in the evolution of a cellular automaton; it is lower in ordered systems and higher in chaotic (disordered) systems.
 
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+