Cellular Automata Entropy

Initializing live version
Download to Desktop

Requires a Wolfram Notebook System

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

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.


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




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.