9887
EXPLORE
LATEST
ABOUT
AUTHORING AREA
PARTICIPATE
Your browser does not support JavaScript or it may be disabled!
Range-Zero Binary Cellular Automata
The range of cellular automata defines how many neighbors affect the next value for each pixel. Thus, range-zero automata do not take any neighbors into account. There are four possible rules for range-zero cellular automata.
Contributed by:
Michael Schreiber
THINGS TO TRY
Slider Zoom
SNAPSHOTS
RELATED LINKS
Cellular Automaton
(
Wolfram
MathWorld
)
PERMANENT CITATION
"
Range-Zero Binary Cellular Automata
" from
the Wolfram Demonstrations Project
http://demonstrations.wolfram.com/RangeZeroBinaryCellularAutomata/
Contributed by:
Michael Schreiber
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 »
Download Demonstration as CDF »
Download Author Code »
(preview »)
Files require
Wolfram
CDF Player
or
Mathematica
.
Related Demonstrations
More by Author
Representing an Integer with an Elementary Automaton
Michael Schreiber
Compressed Constrained Cellular Automaton Initialization
Michael Schreiber
Sorted Evolutions of Cellular Automata
Michael Schreiber
Reversible Multiplex of Totalistic Cellular Automata
Michael Schreiber
Totalistic Automata with Hexagonal Neighborhoods
Michael Schreiber
Elementary Cellular Automaton Process Visualization
Michael Schreiber
Coevolving Complements
Michael Schreiber
Forest Fire Simulation Using a Randomized Hexagonal Automaton
Michael Schreiber
Semi-Rotation Automaton Plot
Michael Schreiber
Decomposition of 2,3 Turing Machine Evolutions
Michael Schreiber
Related Topics
Algorithms
Cellular Automata
Computational Universe
NKS / Wolfram Science
Short Programs
Theory of Computation
Browse all topics
Note: To run this Demonstration you need Mathematica 7+ or the free Mathematica Player 7EX
Download or upgrade to
Mathematica Player 7EX
I already have
Mathematica Player
or
Mathematica 7+