Representing Elementary Cellular Automaton Rules

Each cellular automaton rule can be represented as a decimal number obtained by reading its rule icon in base 2. This Demonstration shows this derivation for the elementary cellular automata, as well as the evolution of each automaton from a single black cell.


Inspired by H. Zenil, "Basic Notions of NKS: Intrinsic Randomness, Exhaustive Searches I," Presentation at NKS Summer School, 2007.
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+