Elementary CA rules 30 and 110

Rule 30


Rule 110

π

March, 14 is the π day!

This image shows the 200 first π numbers in a graph form. To see more take a look at the Demonstration Gaphs of Successive Digits of Pi, e, and Phi or click at the image to magnify.

Click at the image to see the big picture. With zoom it is possible take a look the each CA rule in detail.

1D Elementary Cellular Automaton - 2 colors 3 neighbors - initial condition = 1 - 20 steps



1D Elementary Cellular Automata - 2 colors 3 neigbours - random initial condition - 20 steps

Invaders from the Computational Universe

Check out: Demonstration about Invaders and Breath of Complexity

2D 9-neighbors 3 Colors Cellular Automaton

This is the first 9 steps of rule 477 for a 2D 9-neighbors 3 colors CA (1,7MB)

2D Cellular Automaton

Patterns from Mean of 2D Cellular Automaton with 9 Neighbors, rule 566 from 1024.

To know more about Cellular Automaton and computing with simple rules, take a look at Wolfram's book New Kind of Science (NKS) available on-line.

3D view of 2D Cellular Automaton evoloution

This is a plot of the 2D (9-neighbor) totalistic 2 colors (black and white) Cellular Automaton, each block represent a black color, white color are suppressed.
Each 3D Layers is an step of the CA, there are 1024 rules.

Rule 54Rule 25Rule 978

Programming languages

Good tools:

Java - Cool, practical, well documented, and good free development environments available

Mathematica - More high level programming language, "just do it", go and concentrate just at the problem, there is no need to spend time with extra coding

C (not C++) - Simple and clean - for OOP it is better work with Java (more fun)

SQL and PL/SQL (Oracle) - Big problems with data can be solved at the database level, quickly fast, trustworthy and practical.

Look for the right tool for the right job, and do not spend time.