Notes
Chapter 12: The Principle of Computational Equivalence
Block occurrences [in rule 30]
Character of [general] principles [in science]
[Construction of] universal objects
Criteria for universality [in systems]
History [of universal objects]
Initial conditions [as oracles]
Amount of computation [and computational irreducibility]
[Computation of] mathematical functions
[Examples of] reducible systems
[Examples of] short computations
Formulas [and computational irreducibility]
History [of computational irreducibility]
[Computational complexity of] finding outcomes
Computational complexity theory
Functions [computed by Turing machines]
Growth rates [of halting times]
History [of computational complexity theory]
Implementation [of TM cellular automaton]
[Intractability in] systems of limited size
Longest halting times [in Turing machines]
Lower bounds [on computational complexity]
Non-deterministic Turing machines
[NP completeness in] natural systems
Properties [of example Turing machines]
Satisfiability [emulating Turing machines]
Undecidability in cellular automata
[Undecidability in] natural systems
Algebraic systems [and operator systems]
Comparison to multiway systems
Consistency [in axiom systems]
Encodings of arithmetic [by different operations]
Essential incompleteness [in axiom systems]
[Examples of] unprovable statements
Forcing of operators [by axiom systems]
Generators and relations [and axiom systems]
Groups and semigroups [and operator systems]
History [of concept of mathematics]
[History of] models of mathematics
Implementation [of operators from axioms]
Implementation [of proof example]
Invention versus discovery in mathematics
Large solutions [to Diophantine equations]
[Mathematical] proofs in practice
More powerful axioms [for mathematics]
Multiway systems [and operator systems]
Nearby powers [and integer equations]
Notations [for logical primitives]
One-way transformations [as axioms]
Ordering of [mathematical] constructs
Properties [of Diophantine equations]
Properties [of example multiway systems]
Properties [of example multiway systems]
Properties [of example multiway systems]
Properties [of logical primitives]
Properties [of operators from axioms]
Reducing axiom [system] details
Rules [for multiway systems examples]
Statements in Peano arithmetic
Substitution strategies [in proofs]
Symbolic systems [and operator systems]
Theorem distributions [in standard mathematics]
[Theorems about] practical programs
Truth and falsity [in formal systems]
Universal Diophantine equation
[Universality of] algebraic axioms
[Universality of] predicate logic
Doubling rules [cellular automata]
Forms of [engineered] artifacts
Higher perception and analysis
History [of extraterrestrial life]
[Ideas of] meaning in programs
[Meaning in] molecular biology
Messages to send [to extraterrestrials]
Minimal cellular automata for sequences
Other examples [of minimal systems]
Possible purposes [for systems]
Practical arguments [about exterrestrials]
Properties [of doubling rules]
[Rules implementing] other functions
Science fiction [and extraterrestrials]