(Page 0944d) Notes for: Two Dimensions and Beyond | Systems Based on Constraints Pattern-avoiding sequences As another form of constraint one can require, say, that no pair ...

(Page 1018d) Notes for: Fundamental Physics | The Notion of Reversibility Generalized additive [cellular automaton] rules Additive cellular automata of the kind discussed on ...

(Page 1031e) Notes for: Fundamental Physics | Space as a Network Finding layouts [for networks] One way to lay out a network g so that network distances in it come as close ...

(Page 1114a) Notes for: The Notion of Computation | Emulating Cellular Automata with Other Systems One-element-dependence tag systems [emulating TMs] Writing the rule {3, ...

(Page 1168b) Notes for: The Principle of Computational Equivalence | Implications for Mathematics and Its Foundations Cellular automaton axioms The first 4 axioms are general ...

(Page 0652) In the examples shown, the cellular automata being emulated have 8 cases in their rules, with each case giving the outcome for one of the 8 possible combinations ...

(Page 0767) deterministic. But what the picture shows is that with successive initial conditions it emulates each possible path in the non-deterministic Turing machine. And ...

(Page 1103b) Notes for: Processes of Perception and Analysis | Human Thinking Context-free languages The set of valid expressions in a context-free language can be defined ...

(Page 1053a) Notes for: Fundamental Physics | The Phenomenon of Gravity Pure gravity [theory] In the absence of matter, the Einstein equations always admit ordinary flat ...

(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 ...