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

Cellular Automaton (Wolfram MathWorld)

"Range-Zero Binary Cellular Automata" from The Wolfram Demonstrations Project
http://demonstrations.wolfram.com/RangeZeroBinaryCellularAutomata/

Contributed by: Michael Schreiber

Free Download: Mathematica Player--Runs all Demonstrations & more

Algorithms
Cellular Automata
Computational Universe
NKS / Wolfram Science
Short Programs
Theory of Computation

Browse all topics

Representing an Integer with an Elementary Automaton
Compressed Constrained Cellular Automaton Initialization
Sorted Evolutions of Cellular Automata
Reversible Multiplex of Totalistic Cellular Automata
Totalistic Automata with Hexagonal Neighborhoods
Elementary Cellular Automaton Process Visualization
Coevolving Complements
Forest Fire Simulation Using a Randomized Hexagonal Automaton
Semi-Rotation Automaton Plot
State Emphasis for 2,3 Turing Machine 596440

Email
Link to URL
Embed
Bookmark

Make a new version of this Demonstration
Upload a new Demonstration

Source page:

Name (optional)

Occupation (optional)

Organization (optional)

I use Mathematica:

often

occasionally

never

Country (optional)
Remember me

Note: Please do not include anything you consider confidential or proprietary. We will keep your information private. We will not give it to any third party.
Privacy Policy »