Elementary Cellular Automaton Rules by Gray Code

Neighboring tiles evolve according to elementary cellular automaton rules that differ by one bit if Gray ordering is selected. Compare the 256 results for all elementary rules obtained from selected initial conditions of width nine. The initial conditions can be selected by ordinary enumeration order or by Gray code order, in which neighboring initializations differ by exactly one bit.
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+