Blocks in Cellular Automaton Patterns


	See which blocks appear where in a cellular automaton pattern. So far as one can tell, rule 30 makes a sufficiently random pattern that any block of any length eventually appears in it.


	Contributed by: Stephen Wolfram

The Content of the Principle [of Computational Equivalence] (NKS|Online)

"Blocks in Cellular Automaton Patterns" from The Wolfram Demonstrations Project
http://demonstrations.wolfram.com/BlocksInCellularAutomatonPatterns/

Contributed by: Stephen Wolfram

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

Cellular Automata
Coding Theory
Data Analysis
NKS / Wolfram Science
NKS Book
Statistics

Browse all topics

Compressed Constrained Cellular Automaton Initialization
Almost-Circular Cellular Automaton
Constant-Addition Continuous Cellular Automaton
General Additive Cellular Automata
Cellular Automata as Mappings
States from All Possible Elementary Cellular Automata
Elementary Cellular Automaton Rules by Gray Code
Flipping between Two Elementary Cellular Automaton Rules
Combining Blocks
Five-Neighbor Two-Color Outer Totalistic 2D Cellular Automaton

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 »