auto
small
medium
large
x-large
Chapter 3
auto
small
medium
large
x-large
Jump to page
Lookup in index
Search
‹
›
Chapter 3:
The World of Simple Programs
Section 1:
The Search for General Features
Section 2:
More Cellular Automata
Section 3:
Mobile Automata
Section 4:
Turing Machines
Section 5:
Substitution Systems
Section 6:
Sequential Substitution Systems
Section 7:
Tag Systems
Section 8:
Cyclic Tag Systems
Section 9:
Register Machines
Section 10:
Symbolic Systems
Section 11:
Some Conclusions
Section 12:
How the Discoveries in This Chapter Were Made
Resources For This Page:
2,2 Turing Machines
Cellular Automata Coupled by Overlap or Common Boundary
Cellular Automaton Explorer
Colorization of Cellular Automata
Competing Cellular Automata
Coupled Cellular Automata: Symbiotic Patterns and Synchronization
Coupling Cellular Automata with Substitution Systems
Cyclic Tag Systems
Embryonic Cleavage
Examples of 1D Three-Color Totalistic Cellular Automata
Flipping between Two Elementary Cellular Automaton Rules
Frequency of Cellular Automata
Generalized Mobile Automata
Hofstadter's MU Riddle
Machine Language Pattern for lsmod Program
MIU Explorer
Multiway Systems Based on Numbers
Neighbor-Dependent Substitution System
pq
-System Explorer
Primality Formal System Explorer
tq
-System Explorer
Turing Machine Enumeration: NKS versus Lexicographical
Turing Machines with Memory
