(Page 0984f) Notes for: Mechanisms in Programs and Nature | The Problem of Satisfying Constraints Implementation [of constraint satisfaction] The number of squares violating ...

(Page 0507) property that the form of this causal network ends up being the same regardless of the order in which replacements are applied -- and thus regardless of the path ...

(Page 0888a) Notes for: The World of Simple Programs | Turing Machines Implementation [of Turing machines] The state of a Turing machine at a particular step can be ...

(Page 0895b) Notes for: The World of Simple Programs | Cyclic Tag Systems Generalizations [of cyclic tag systems] The implementation above immediately allows cyclic tag ...

(Page 0911e) Notes for: Systems Based on Numbers | The Sequence of Primes Iterated aliquot sums Related to case (b) above is a system which repeats the replacement ...

(Page 0936b) Notes for: Two Dimensions and Beyond | Network Systems Properties [of network systems] Random behavior seems to occur in a few out of every thousand randomly ...

(Page 0941f) Notes for: Two Dimensions and Beyond | Systems Based on Constraints Checking [tilings with] constraints A set of allowed templates can be specified by a ...

(Page 0963b) Notes for: Starting from Randomness | The Notion of Attractors [State networks for] shift rules The pictures below show networks obtained with rule 170, which ...

(Page 1022f) Notes for: Fundamental Physics | Conserved Quantities and Continuum Phenomena Implementation [of conserved quantity test] Whether a k -color cellular automaton ...

(Page 1038f) Notes for: Fundamental Physics | Evolution of Networks [Generating] random networks One way to generate the connections for a "completely random" trivalent ...