(Page 0945c) Notes for: Two Dimensions and Beyond | Systems Based on Constraints Constraints on formulas Many standard problems of algebraic computation can be viewed as ...

(Page 0897a) Notes for: The World of Simple Programs | Symbolic Systems [Enumerating] possible expressions LeafCount[expr] gives the number of symbols that appear anywhere in ...

(Page 1153f) Notes for: The Principle of Computational Equivalence | Implications for Mathematics and Its Foundations Other algebraic systems Of algebraic systems studied in ...

(Page 1157a) Notes for: The Principle of Computational Equivalence | Implications for Mathematics and Its Foundations Nand tautologies At each step every possible ...

(Page 1122a) Notes for: The Notion of Computation | Universality in Turing Machines and Other Systems Combinator properties The size of a combinator expression is ...

(Page 0907b) Notes for: Systems Based on Numbers | Recursive Sequences Primitive recursive functions As part of trying to formalize foundations of arithmetic Richard Dedekind ...

(Page 1160b) Notes for: The Principle of Computational Equivalence | Implications for Mathematics and Its Foundations Universal Diophantine equation The equation is built up ...