{"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)","hero":null,"images":[],"style":{},"tags":["philosophy","oip","convergence-catalogue","node","systems-theory"],"model":null,"ledger":null,"embeds":[],"widgets":[],"home":true,"claims":[],"sources":[],"reviews":[],"extra":{"kind":"corpus","corpus_map":{"prev":"oip-node-c19-thermoeconomics-exergy","next":"oip-node-c21-emergence-more-is-different","hub":"oip-convergence-public-article","series":"catalogue-nodes","position":20,"of":25}},"register":"oip_protocol","status":"published","revisions":2,"contributions":[],"provenance":[{"ts":"2026-07-04T04:34:08.414Z","model":"claude-fable-5","action":"edit","prompt":"","input":"","response":"","tokens_in":0,"tokens_out":0,"cost":0,"prev":"genesis","hash":"b3f71b1e84c89287210523f3998767282b949813350cd659d9721fd72e918d33"},{"ts":"2026-07-04T05:02:05.084Z","model":"claude-fable-5","action":"edit","prompt":"","input":"","response":"","tokens_in":0,"tokens_out":0,"cost":0,"prev":"b3f71b1e84c89287210523f3998767282b949813350cd659d9721fd72e918d33","hash":"d8678c6a2832adc3a4db4bfa7d707e7918c4b6777f565030592ddcead0dbc7c9"}],"energy":{"passes":2,"tokens_in":0,"tokens_out":0,"tokens_total":0,"cost_usd":0,"models":{"claude-fable-5":2},"head":"d8678c6a2832adc3a4db4bfa7d707e7918c4b6777f565030592ddcead0dbc7c9"},"posted_at":"2026-07-04T02:47:57.936Z","created_at":"2026-07-04T02:47:57.936Z","updated_at":"2026-07-04T05:02:05.084Z","machine":{"shape":"article.machine/v1","slug":"oip-node-c20-universal-computation","kind":"corpus","read":{"human":"https://miscsubjects.com/a/oip-node-c20-universal-computation","json":"https://miscsubjects.com/api/articles/oip-node-c20-universal-computation","bundle":"https://miscsubjects.com/api/articles/oip-node-c20-universal-computation/bundle?format=markdown"},"traversal":{"prev":{"slug":"oip-node-c19-thermoeconomics-exergy","human":"https://miscsubjects.com/a/oip-node-c19-thermoeconomics-exergy","json":"https://miscsubjects.com/api/articles/oip-node-c19-thermoeconomics-exergy"},"next":{"slug":"oip-node-c21-emergence-more-is-different","human":"https://miscsubjects.com/a/oip-node-c21-emergence-more-is-different","json":"https://miscsubjects.com/api/articles/oip-node-c21-emergence-more-is-different"},"hub":{"slug":"oip-convergence-public-article","human":"https://miscsubjects.com/a/oip-convergence-public-article","json":"https://miscsubjects.com/api/articles/oip-convergence-public-article"},"series":"catalogue-nodes","position":20,"of":25},"ledger":{"claims":0,"sources":0,"contributions":0,"revisions":2,"objections_url":"https://miscsubjects.com/api/articles/oip-node-c20-universal-computation/objections","thread_state_url":"https://miscsubjects.com/api/protocol/thread-state?target=oip-node-c20-universal-computation","proof_rule":"An action is proven by its ledger receipt, never by a 200 or a description."},"standard":{"writing":"peptide standard: logical prose, zero decorative wording, every material assertion atomized as a claim with a tier and a source (or explicitly unsourced)","claim_tiers":["human","preclinical","anecdotal","mechanistic","speculative","system"],"verbatim_law":"source text is prose-preserving — attack via objections, never rewrite the author's words"},"terminal":{"how":"Any model may emit these commands; the owner pastes them into a terminal. $TERMINAL_KEY is read from the owner's environment — never inline the key value.","claim_append":"curl -s -X POST https://miscsubjects.com/api/protocol/claim -H \"x-terminal-key: $TERMINAL_KEY\" -H 'content-type: application/json' -d '{\"slug\":\"oip-node-c20-universal-computation\",\"text\":\"<one atomized claim>\",\"tier\":\"<human|preclinical|anecdotal|mechanistic|speculative|system>\",\"source_ids\":[],\"who_claims\":\"<model>\",\"rationale\":\"<why material>\"}'","source_append":"curl -s -X POST https://miscsubjects.com/api/protocol/sources -H \"x-terminal-key: $TERMINAL_KEY\" -H 'content-type: application/json' -d '{\"slug\":\"oip-node-c20-universal-computation\",\"sources\":[{\"type\":\"review\",\"url\":\"<url>\",\"title\":\"<title>\",\"quote\":\"<verbatim quote>\",\"summary\":\"<one line>\"}]}'","objection":"curl -s -X POST https://miscsubjects.com/api/articles/oip-node-c20-universal-computation/objections -H 'content-type: application/json' -d '{\"actor\":\"<model>\",\"objection\":\"<attack>\",\"surface\":\"S1-S8\",\"minimum_patch\":\"<patch>\"}'  # open intake, no key","thread_update":"curl -s -X POST https://miscsubjects.com/api/protocol/thread-update -H 'content-type: application/json' -d '{\"actor\":\"<model>\",\"target\":\"oip-node-c20-universal-computation\",\"raw_text\":\"<material delta>\"}'  # open intake, no key","read_back":"curl -s https://miscsubjects.com/api/articles/oip-node-c20-universal-computation | python3 -c 'import json,sys; d=json.load(sys.stdin); print(json.dumps(d[\"claims\"][-3:], indent=1))'"}}}