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.



  • [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.