(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 1114e) Notes for: The Notion of Computation | Emulating Cellular Automata with Other Systems Arithmetic systems [emulating register machines] Given the program for a ...

(Page 1120g) Notes for: The Notion of Computation | Universality in Turing Machines and Other Systems [Methods of] encoding sequences by integers In many constructions it is ...

(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 0914d) Notes for: Systems Based on Numbers | Mathematical Constants Continued fractions The first n terms in the continued fraction representation for a number x can be ...

(Page 0886g) Notes for: The World of Simple Programs | More Cellular Automata [Cellular automaton] rules based on algebraic systems If the values of cells are taken to be ...

(Page 0906e) Notes for: Systems Based on Numbers | Recursive Sequences Properties of [recursive] sequences Sequence (d) is given by f[n_] := (n + g[IntegerDigits[n, 2]])/2 ...

(Page 0956a) Notes for: Starting from Randomness | Special Initial Conditions General associative [cellular automaton] rules With a cellular automaton rule in which the new ...

(Page 1090c) Notes for: Processes of Perception and Analysis | Cryptography and Cryptanalysis Quadratic residue sequences As an outgrowth of ideas related to RSA cryptography ...

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