{"slug":"oip-node-c20-universal-computation","title":"Node C20: Universal Computation","body":"# Node C20: Universal Computation\n\nC20 — Universal Computation\n{\n  \"id\": \"C20\",\n  \"claim\": \"One abstract machine (Turing machine / lambda calculus) can simulate any other; some physical processes are computationally irreducible — no shortcut to their outcome exists.\",\n  \"domain\": [\"mathematical logic\", \"computer science\", \"theoretical physics\", \"cellular automata\"],\n  \"pattern\": [\"universality\", \"Turing_completeness\", \"computational_irreducibility\", \"simulation\"],\n  \"mechanism\": \"Church-Turing thesis: any effectively calculable function is computable by a Turing machine. Universal Turing machine: a single machine that can simulate any other Turing machine given its description and input. Computational irreducibility (Wolfram): for some systems, the only way to determine the outcome is to run the full computation — no predictive compression exists.\",\n  \"scale\": \"abstract → physical\",\n  \"claim_tier\": \"T0 (core logic) / T3 (pancomputationalism)\",\n  \"sources\": [\n    \"Church, A. (1936). 'An Unsolvable Problem of Elementary Number Theory.' Am. J. Math., 58, 345-363.\",\n    \"Turing, A.M. (1936). 'On Computable Numbers, with an Application to the Entscheidungsproblem.' Proc. Lond. Math. Soc., 42, 230-265.\",\n    \"von Neumann, J. (1945). 'First Draft of a Report on the EDVAC.' Moore School.\",\n    \"Wolfram, S. (2002). A New Kind of Science. Wolfram Media. [Computational irreducibility, Rule 110.]\"\n  ],\n  \"dual\": \"Non-computable — a process that cannot be simulated by any Turing-equivalent machine; hypercomputation.\",\n  \"falsifier\": \"A physical process provably non-simulable by any Turing machine — e.g., a system exploiting real numbers with infinite precision, or a quantum gravitational process beyond Turing computation. (Note: quantum computation is still within the extended Church-Turing thesis.)\",\n  \"rival_frame\": \"The Church-Turing thesis is a hypothesis about physical reality, not a theorem. It may fail at quantum or biological scales. 'Computational irreducibility' is a vacuous claim — it says 'some things are hard to predict,' which is trivial. Wolfram's pancomputationalism is speculative metaphysics, not science.\",\n  \"independence_check\": \"HIGH. Church (logic, Princeton, 1936) derived computability from lambda calculus. Turing (mathematics, Cambridge/Princeton, 1936) derived it from mechanical procedures and the Entscheidungsproblem. von Neumann (engineering, IAS, 1945) designed the stored-program computer architecture independently. Wolfram (physics/UIUC, 2002) derived irreducibility from cellular automata. Four independent origins, same concept: universal simulation.\",\n  \"pattern_type\": \"mathematical\",\n  \"maps_to_axiom\": [\"A3\"]\n}\n\n---\n\n## Corpus map\n- Same node, other planes: [Encyclopedia C20](/a/convergence-encyclopedia-c20) · [Inventory invariant](/a/oip-invariant-20-320-universal-computation)\n- Catalogue hub: [Public Article](/a/oip-convergence-public-article) · [Schema](/a/oip-convergence-schema)","register":"oip_protocol","tags":["philosophy","oip","convergence-catalogue","node","systems-theory"],"category":null,"style":{},"claims":[{"id":"c1","text":"One abstract machine (Turing machine / lambda calculus) can simulate any other.","section":"## C20 — Universal Computation","tier":"mechanistic","source_ids":[],"source_status":"unsourced","why_material":"Core definition of universality in computation."},{"id":"c2","text":"Some physical processes are computationally irreducible — no shortcut to their outcome exists.","section":"## C20 — Universal Computation","tier":"mechanistic","source_ids":[],"source_status":"unsourced","why_material":"States computational irreducibility as a property of certain systems."},{"id":"c3","text":"Any effectively calculable function is computable by a Turing machine.","section":"## C20 — Universal Computation","tier":"mechanistic","source_ids":[],"source_status":"unsourced","why_material":"States the Church-Turing thesis."},{"id":"c4","text":"A single machine exists that can simulate any other Turing machine given its description and input.","section":"## C20 — Universal Computation","tier":"mechanistic","source_ids":[],"source_status":"unsourced","why_material":"Defines the universal Turing machine."},{"id":"c5","text":"For some systems the only way to determine the outcome is to run the full computation with no predictive compression existing.","section":"## C20 — Universal Computation","tier":"mechanistic","source_ids":[],"source_status":"unsourced","why_material":"States computational irreducibility per Wolfram from cellular automata."},{"id":"c6","text":"Church (1936), Turing (1936), von Neumann (1945), and Wolfram (2002) provide four independent derivations of universal simulation from logic, mathematics, engineering, and cellular automata respectively.","section":"## C20 — Universal Computation","tier":"anecdotal","source_ids":[],"source_status":"unsourced","why_material":"Establishes independence of the concept origins."}],"sources":[],"prov":{"model":"Fable 5 (Claude Code)","action":"write"}}