EXPLORE
LATEST
ABOUT
AUTHORING AREA
PARTICIPATE
Your browser does not support JavaScript or it may be disabled!
Subscribe to RSS feed
Simple Computational Systems
«
PREVIOUS

1

2

3

4

5

NEXT
»
Demonstrations 61  80 of 92
Elementary Cellular Automaton Rules by Gray Code
Look and Say Sequence Substrings
Tree Form of Recursive Function Evaluation Steps
Elementary Cellular Automaton Process Visualization
Coevolving Complements
Compressed Constrained Cellular Automaton Initialization
SelfDelimiting Binary Representation of a Ternary List
Parity Entangled Links
Parity Entangled Rings
TicTacToe
Totalistic Automata with Hexagonal Neighborhoods
Reversible Multiplex of Totalistic Cellular Automata
Bootstrap Percolation Automaton
String Matching Automaton
Propp Circles
Condensed Cellular Automaton States
Random Binary Differences
Visual Encryption Pad
Fibonacci Mountain Matra Meru
Rule 54
«
PREVIOUS

1

2

3

4

5

NEXT
»
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+