(Page 0931f) Notes for: Two Dimensions and Beyond | Substitution Systems and Fractals Sierpinski pattern Other ways to generate step n of the pattern shown here in various ...

(Page 0889b) Notes for: The World of Simple Programs | Substitution Systems Implementation [of substitution systems] The rule for a neighbor-independent substitution system ...

(Page 0895a) Notes for: The World of Simple Programs | Cyclic Tag Systems Implementation [of cyclic tag systems] With the rules for the cyclic tag system on page 95 given as ...

(Page 0896f) Notes for: The World of Simple Programs | Symbolic Systems Implementation [of symbolic systems] The evolution for t steps of the first symbolic system shown can ...

(Page 0892d) Notes for: The World of Simple Programs | Substitution Systems Paperfolding sequences The sequence of up and down creases in a strip of paper that is ...

(Page 0904b) Notes for: Systems Based on Numbers | Elementary Arithmetic Implementation [of 3/2 system] The evolution for t steps of the system at the top of the page can be ...

(Page 0955f) Notes for: Starting from Randomness | Special Initial Conditions Fractal dimensions [of additive cellular automata] The total number of nonzero cells in the ...

(Page 0894d) Notes for: The World of Simple Programs | Tag Systems Implementation [of tag systems] With the rules for case (a) on page 94 given for example by {2, {{0,0} -> ...

(Page 0898c) Notes for: The World of Simple Programs | Symbolic Systems Operator systems One can generalize symbolic systems by having rules that define transformations for ...

(Page 0901a) Notes for: Systems Based on Numbers | The Notion of Numbers Implementation of digit sequences A whole number n can be converted to a sequence of digits in base k ...