Notes

Chapter 12: The Principle of Computational Equivalence


Section 1: Basic Framework

All is computation

Section 2: Outline of the Principle

[History of] Church's Thesis History [of PCE] Note for mathematicians [about PCE]

Section 3: The Content of the Principle

Block occurrences [in rule 30] Character of [general] principles [in science] [Construction of] universal objects Criteria for universality [in systems] Density of universal systems Encodings [for universality] History [of universal objects] Initial conditions [as oracles] Oracles [for universal systems] Proving universality

Section 4: The Validity of the Principle

Computable reals Constructible reals Continuous computation Continuum and cardinality Diagonal arguments Emulating discrete systems [with continuous ones] Human thinking [and PCE] Initial conditions [and continuity] Intermediate degrees Time and gravity [Time compression in] ODEs [Universality in] equations

Section 5: Explaining the Phenomenon of Complexity

Definition of complexity Ingredients for complexity Relativism and equivalence

Section 6: Computational Irreducibility

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] [History of] exact solutions Intrinsic limits in science More complicated rules [and reducibility] Speed-up theorems

Section 7: The Phenomenon of Free Will

Amounts of free will Determinism in brains [Free] will and purpose History [of ideas about free will] Responsibility [and free will] Source of [free] will

Section 8: Undecidability and Intractability

Algorithmic complexity theory Circuit complexity [Classes of] fast algorithms Code 1004600 [Computational complexity of] finding outcomes Computational complexity theory Correspondence systems Density of difficult problems Examples of undecidability Functions [computed by Turing machines] Growth rates [of halting times] Halting problems History [of computational complexity theory] History [of undecidability] Implementation [of TM cellular automaton] [Intractability in] systems of limited size Longest halting times [in Turing machines] Lower bounds [on computational complexity] Mathematical impossibilities Multiway tag systems Non-deterministic Turing machines NP completeness [NP completeness in] natural systems [One-sided] Turing machines P completeness P versus NP questions Proofs of undecidability Properties [of example Turing machines] Quantum computers Rule 30 inversion Satisfiability [emulating Turing machines] Sequence equations Sorting networks [Turing] machine 1507 [Turing] machine 600720 Undecidability and sets Undecidability in cellular automata Undecidability in Mathematica [Undecidability in] natural systems Undecidability in tiling problems Word problems

Section 9: Implications for Mathematics and Its Foundations

Algebraic axioms Algebraic systems [and operator systems] Automated theorem proving Axiom schemas Axiom systems Axiom systems for programs [Axioms for] arithmetic [Axioms for] geometry [Axioms for] real analysis Basic logic [and axioms] Category theory Cellular automaton axioms Character of mathematics Comparison to multiway systems Consistency [in axiom systems] Diophantine equations Empirical metamathematics Encodings of arithmetic [by different operations] Equivalential calculus Essential incompleteness [in axiom systems] [Examples of] unprovable statements Fermat's Last Theorem Fields [and axioms] Finite axiomatizability Forcing of operators [by axiom systems] Frameworks [in mathematics] General topology [and axioms] Generalization in mathematics Generators and relations [and axiom systems] Gödel's Theorem Groups [and axioms] Groups and semigroups [and operator systems] Growth rates [of functions] Higher-order logics Hilbert's Tenth Problem History [of concept of mathematics] History [of logic axioms] [History of] models of mathematics [History of] truth tables Implementation [of operators from axioms] Implementation [of proof example] Implicational calculus Invention versus discovery in mathematics Junctional calculus Large solutions [to Diophantine equations] Logic in languages [Mathematical] proofs in practice Mathematics and the brain [Methods for] proof searching Model theory More powerful axioms [for mathematics] Multivalued logic Multiway systems [and operator systems] Nand tautologies Nand theorems Nearby powers [and integer equations] Non-standard arithmetic Notations [for logical primitives] One-way transformations [as axioms] Operator systems Operators on sets Ordering of [mathematical] constructs Other algebraic systems Polynomial value sets Predicate logic Proof lengths in logic Proof structures Proofs in Mathematica Proofs of axiom systems 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] Pure equational logic Real algebra [and axioms] Reducing axiom [system] details Rings [and axioms] Rules [for multiway systems examples] Searching for logic [axioms] Semigroups [and axioms] Set theory [and axioms] Speedups in other systems Statements in Peano arithmetic Substitution strategies [in proofs] Symbolic systems [and operator systems] [The concept of] infinity Theorem distributions [in standard mathematics] [Theorems about] practical programs Transfinite numbers Truth and falsity [in formal systems] Truth and incompleteness Two-operator logic [axioms] Universal Diophantine equation Universal logical functions [Universality of] algebraic axioms [Universality of] predicate logic [Universality of] set theory [Unprovable statements in] reduced arithmetic Unsolved problems [in number theory]

Section 10: Intelligence in the Universe

Animal artifacts Animal communication Animism Artifacts in data Artificial radio signals Astronomical objects Bird songs Complexity and theology Computer communication Dead languages Decompilers Defining intelligence Defining life Detection methods [for SETI] Doubling rules [cellular automata] Earth from space Extraterrestrial life Forms of [engineered] artifacts Forms of living systems Higher perception and analysis History [of extraterrestrial life] [History of] SETI [Ideas of] meaning in programs Mathematical notation Meaning and regularity [Meaning in] molecular biology Messages in DNA Messages to send [to extraterrestrials] Mimesis Minimal cellular automata for sequences Minimal theories Natural radio emissions Origin of life Other examples [of minimal systems] P versus NP [and messages] Physics as intelligence Possible purposes [for systems] Practical arguments [about exterrestrials] Properties [of doubling rules] Purpose in archeology Purposeful computation Recognizing artifacts [Rules implementing] other functions Science fiction [and extraterrestrials] Searching [for doubling rules] Self-reproduction Teleology The weather Theories of communication Whale songs

Section 11: Implications for Technology

Alkane properties Applications of randomness Components for technology Covering [implications for] technology Future technology [Implications for] chemistry Interesting chemicals Methodology in this book Nanotechnology Searching for technology Self-assembly

Section 12: Historical Perspectives

Animism Aphorisms Human future Human uniqueness Microcosm [and PCE] Non-Western thinking Philosophical implications Postmodernism Universe as intelligent

From Stephen Wolfram: A New Kind of Science [citation]