(Page 1110a) Notes for: The Notion of Computation | The Phenomenon of Universality Universality in Mathematica As an example of how different primitive operations can be used ...

(Page 1170a) Notes for: The Principle of Computational Equivalence | Implications for Mathematics and Its Foundations Operator systems One can represent the possible values ...

(Page 1172b) Notes for: The Principle of Computational Equivalence | Implications for Mathematics and Its Foundations Groups and semigroups [and operator systems] With k ...

(Page 1145b) Notes for: The Principle of Computational Equivalence | Undecidability and Intractability [Turing] machine 600720 (Case (h) of page 763 .) The maximum halting ...

(Page 0980b) Notes for: Mechanisms in Programs and Nature | The Phenomenon of Continuity Isotropy [in lattice systems] Any pattern grown from a single cell according to rules ...

(Page 0893b) Notes for: The World of Simple Programs | Sequential Substitution Systems Implementation [of sequential substitution systems] Sequential substitution systems can ...

(Page 0913c) Notes for: Systems Based on Numbers | Mathematical Constants Concatenation sequences One can consider forming sequences by concatenating digits of successive ...

(Page 1037d) Notes for: Fundamental Physics | Evolution of Networks Implementation [of network substitution rules] For many practical purposes the best representation for ...

(Page 1081c) Notes for: Processes of Perception and Analysis | Auditory Perception [Spectra of] random block sequences Analytical forms for all but the last spectrum are: 1 , ...

(Page 0498) [No text on this page] Captions on this page: Examples of sequential substitution systems of the type discussed on page 88 , and the causal networks that emerge ...