Sorted Evolutions of Cellular Automata
The first 150 evolution states of these two cellular automata are sorted in order from least to greatest. Compare the sorted states of evolution of different rules, or change their common initial condition.
Contributed by:
Michael Schreiber
X
X
X
Show Source Code
|
Download Source Code Notebook
Uniqueness of Patterns
(
NKS|Online
)
"
Sorted Evolutions of Cellular Automata
" from
The Wolfram Demonstrations Project
http://demonstrations.wolfram.com/SortedEvolutionsOfCellularAutomata/
Contributed by:
Michael Schreiber
Cellular Automata
Computational Universe
Discrete Mathematics
NKS / Wolfram Science
NKS Book
Short Programs
Simple Computational Systems
Coevolving Complements
Reversible Multiplex of Totalistic Cellular Automata
Totalistic Automata with Hexagonal Neighborhoods
Decomposition of 2,3 Turing Machine Evolutions
3D Views of Elementary Cellular Automata
Compressed Constrained Cellular Automaton Initialization
Representing an Integer with an Elementary Automaton
Forest Fire Simulation Using a Randomized Hexagonal Automaton
Elementary Cellular Automaton Rules by Gray Code
Range-Zero Binary Cellular Automata
Make a new version of this Demonstration
Upload a new Demonstration
Contact The Wolfram Demonstrations Project Team
Site Index
Wolfram Research
© 2008
The Wolfram Demonstrations Project & Contributors
Terms of Use
Privacy Policy
RSS
Atom
