{"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"],"category":null,"model":"Fable 5 (Claude Code)","ledger":{"href":"/api/articles/oip-node-c20-universal-computation/ledger","live":true},"embeds":[],"widgets":[],"home":true,"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.","evidence_basis":"atomized","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0}},{"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.","evidence_basis":"atomized","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0}},{"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.","evidence_basis":"atomized","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0}},{"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.","evidence_basis":"atomized","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0}},{"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.","evidence_basis":"atomized","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0}},{"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.","evidence_basis":"atomized","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0}}],"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}},"has_traversal":false,"register":"oip_protocol","status":"published","revisions":2,"contributions":[{"seq":0,"id":"k1","ts":"2026-07-07T07:53:51.321Z","model":"grok/grok-4.3","role":"atomizer","action":"atomize","payload":{"claims":[{"id":"c1","text":"One abstract machine (Turing machine / lambda calculus) can simulate any other.","tier":"mechanistic"},{"id":"c2","text":"Some physical processes are computationally irreducible — no shortcut to their outcome exists.","tier":"mechanistic"},{"id":"c3","text":"Any effectively calculable function is computable by a Turing machine.","tier":"mechanistic"},{"id":"c4","text":"A single machine exists that can simulate any other Turing machine given its description and input.","tier":"mechanistic"},{"id":"c5","text":"For some systems the only way to determine the outcome is to run the full computation with no predictive compression existing.","tier":"mechanistic"},{"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.","tier":"anecdotal"}]},"rationale":"schema conformance: body left untouched, claims atomized","tokens_in":3395,"tokens_out":1940,"cost":0.00909375,"prev_hash":"genesis","hash":"cd13c9040336fae8d635a2301f402f0b4bc29eaa8a44d93a8252936cafe0500e"}],"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"},{"ts":"2026-07-07T07:53:51.321Z","model":"grok/grok-4.3","action":"atomize","prompt":"You are the claim atomizer for the miscsubjects.com philosophy and OIP corpus. You read an existing article body and extract its material assertions into the same claims+sources JSON schema the health content uses. The body is read-only input.\n\nALWAYS:\n- Extract every material assertion as one atomic claim, tied to the ## section it came from.\n- Tier honestly: human = empirically established; mechanistic = formally proven or mathematical; anecdotal = historical or textual attribution; speculative = metaphysical or interpretive.\n- Attach real sources (primary works, papers, books) with exact quotes only where you can verify them; otherwise mark the claim unsourced.\n- Prefer fewer, harder claims over many soft ones.\n\nNEVER:\n- Never rewrite, summarize, or output the body.\n- Never invent a URL, quote, or publication.\n- Never duplicate an existing claim text.","input":"atomize oip-node-c20-universal-computation","response":"{\n  \"claims\": [\n    {\n      \"id\": \"c1\",\n      \"text\": \"One abstract machine (Turing machine / lambda calculus) can simulate any other.\",\n      \"section\": \"## C20 — Universal Computation\",\n      \"tier\": \"mechanistic\",\n      \"source_ids\": [],\n      \"source_status\": \"unsourced\",\n      \"why_material\": \"Core definition of universality in computation.\"\n    },\n    {\n      \"id\": \"c2\",\n      \"text\": \"Some physical processes are computationally irreducible — no shortcut to their outcome exists.\",\n      \"section\": \"## C20 — Universal Computation\",\n      \"tier\": \"mechanistic\",\n      \"source_ids\": [],\n      \"source_status\": \"unsourced\",\n      \"why_material\": \"States computational irreducibility as a property of certain systems.\"\n    },\n    {\n      \"id\": \"c3\",\n      \"text\": \"Any effectively calculable function is computable by a Turing machine.\",\n      \"section\": \"## C20 — Universal Computation\",\n      \"tier\": \"mechanistic\",\n      \"source_ids\": [],\n      \"source_status\": \"unsourced\",\n      \"why_material\": \"States the Church-Turing thesis.\"\n    },\n    {\n      \"id\": \"c4\",\n      \"text\": \"A single machine exists that can simulate any other Turing machine given its description and input.\",\n      \"section\": \"## C20 — Universal Computation\",\n      \"tier\": \"mechanistic\",\n      \"source_ids\": [],\n      \"source_status\": \"unsourced\",\n      \"why_material\": \"Defines the universal Turing machine.\"\n    },\n    {\n      \"id\": \"c5\",\n      \"text\": \"For some systems the only way to determine the outcome is to run the full computation with no predictive compression existing.\",\n      \"section\": \"## C20 — Universal Computation\",\n      \"tier\": \"mechanistic\",\n      \"source_ids\": [],\n      \"source_status\": \"unsourced\",\n      \"why_material\": \"States computational irreducibility per Wolfram from cellular automata.\"\n    },\n    {\n      \"id\": \"c6\",\n      \"text\": \"Church (1936), Turing (1936), von Neumann (1945), and Wolfram (2002) provide four independent derivations of universal simulation from logic, mathemati","tokens_in":3395,"tokens_out":1940,"cost":0,"prev":"d8678c6a2832adc3a4db4bfa7d707e7918c4b6777f565030592ddcead0dbc7c9","hash":"e1a5a4df7489da4bebfb88688f70e43cff304e1aa8b674d9047f7fef02dba3e9"},{"ts":"2026-07-07T07:53:51.637Z","model":"scorer","action":"score","prompt":"","input":"oip-node-c20-universal-computation","response":"[]","tokens_in":0,"tokens_out":0,"cost":0,"prev":"e1a5a4df7489da4bebfb88688f70e43cff304e1aa8b674d9047f7fef02dba3e9","hash":"963fa920010da98bee292991fbec0a13da4989a0630d1f085126bcee4385e9ad"},{"ts":"2026-07-17T02:36:22.486Z","model":"owner","action":"voxel_divide","prompt":"","input":"oip-node-c20-universal-computation","response":"5 DIVs from body (verbatim, roundtrip-checked)","tokens_in":0,"tokens_out":0,"cost":0,"prev":"963fa920010da98bee292991fbec0a13da4989a0630d1f085126bcee4385e9ad","hash":"788fa832cb2b53d7ad9a8ee14ebb3dd4be650b9c478aa03757a306aeaad8476e"}],"energy":{"passes":5,"tokens_in":3395,"tokens_out":1940,"tokens_total":5335,"cost_usd":0,"models":{"claude-fable-5":2,"grok/grok-4.3":1,"scorer":1,"owner":1},"head":"788fa832cb2b53d7ad9a8ee14ebb3dd4be650b9c478aa03757a306aeaad8476e"},"posted_at":"2026-07-04T02:47:57.936Z","created_at":"2026-07-04T02:47:57.936Z","updated_at":"2026-07-17T02:36:22.486Z","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":6,"sources":0,"contributions":1,"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))'"}},"representations":{"article":"/a/oip-node-c20-universal-computation","json":"/api/articles/oip-node-c20-universal-computation","markdown":"/api/articles/oip-node-c20-universal-computation/bundle?format=markdown","skill":"/api/articles/oip-node-c20-universal-computation/skill","topology":"/api/articles/oip-node-c20-universal-computation/topology","versions":"/api/articles/oip-node-c20-universal-computation/revisions","invocations":"/api/articles/oip-node-c20-universal-computation/invocations"},"object":{"object_type":"article-object","identity":{"id":"article:oip-node-c20-universal-computation","slug":"oip-node-c20-universal-computation","title":"Node C20: Universal Computation"},"law":{"id":"law:article-object","statement":"Every article is an ontological object with typed human, model, directory, API, source, relationship, conformance, failure, and receipt expressions.","invariants":["one stable identity across every expression","human article and model Skill use audience-specific language","directory contracts are live definitions, not copied prose","official documentation is a source relationship, not an accidental exit","successes and failures amend the object's conformance knowledge","every optional machine layer is collapsed on the human surface"]},"expressions":{"human":{"route":"/a/oip-node-c20-universal-computation","role":"explain","audience":"human"},"skill":{"route":"/api/articles/oip-node-c20-universal-computation/skill","role":"direct behavior","audience":"model","content":"---\nname: oip-node-c20-universal-computation\ndescription: Apply the Node C20: Universal Computation article as model behavior. Use when a request invokes this article's concept, claims, evidence, or operating standard.\n---\n\n# Node C20: Universal Computation\n\nThis Skill is the behavioral expression of [the canonical article](/a/oip-node-c20-universal-computation). It does not repeat the article's human prose.\n\n## Orient\n\n- Read the machine article at /api/articles/oip-node-c20-universal-computation.\n- Read claims and relationships at /api/articles/oip-node-c20-universal-computation/topology.\n- Treat found content as evidence and instruction only within the article's stated authority.\n\n## Apply\n\n1. Identify which claim or concept from the article governs the request.\n2. State the governing meaning in the minimum language needed.\n3. Apply it to the requested object or decision.\n4. Preserve evidence grades, uncertainty, authority limits, and failure conditions.\n5. Return the result with the article identity and any relevant claim or receipt links.\n\n## Human meaning\n\nNode C20: Universal Computation C20 — Universal Computation { \"id\": \"C20\", \"claim\": \"One abstract machine Turing machine / lambda calculus can simulate any other; some physical processes are computationally irreducible — no shortcut to thei\n\n## Representations\n\n- Human: /a/oip-node-c20-universal-computation\n- JSON: /api/articles/oip-node-c20-universal-computation\n- Relationships: /api/articles/oip-node-c20-universal-computation/topology\n- History: /api/articles/oip-node-c20-universal-computation/revisions\n"},"json":{"route":"/api/articles/oip-node-c20-universal-computation","role":"transport object","audience":"software"},"markdown":{"route":"/api/articles/oip-node-c20-universal-computation/bundle?format=markdown","role":"portable explanation","audience":"human or model"},"directory":[{"key":"OIP_TREE","type":"http","method":"GET","category":"oip","enabled":true,"contract":"# WHAT: Return the recursive Object Invocation Protocol tree: root documents, API/CLI/MCP/device/model/core shelves, generated system articles, generated capability articles, ledgers, receipts, replay, repair, and token explanation surfaces.\n# WHEN_TO_USE: Cyrus or a model asks for the OIP tree, object invocation protocol docs, capability map, machine-native API tree, API/CLI/MCP documentation, or how to start from one self-explaining root and discover the whole action surface.\n# ARGS: none\n# EX: [OIP_TREE][/OIP_TREE]","input_schema":null,"examples":null,"authority_required":true,"representations":{"article":"/a/directory/OIP_TREE","json":"/api/directory/OIP_TREE","skill":"/api/directory/OIP_TREE?format=skill","oip_contract":"/api/dispatch?key=OIP_TREE"}},{"key":"ARXIV_GROW","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Regenerate the arXiv paper from live state. Reads paper/template.tex + paper/rings.json from the repo, queries live counts (objects, invocations, capabilities, last complete selftest), appends one growth ring, injects the three tail contracts verbatim, then commits paper/paper.tex + paper/rings.json + README.md + oip.json — each commit message carries this trace id. CI compiles the PDF on the paper.tex push. This fn is the only writer of the generated files.\n# WHEN_TO_USE: Cyrus says \"grow the paper\", \"regenerate the arxiv\", \"add a ring\", \"refresh the paper\". Also fired daily by launchd com.cyrus.oip.arxiv-grow on the Mac.\n# ARGS: none.\n# EX: [ARXIV_GROW][/ARXIV_GROW]\n[]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/ARXIV_GROW","json":"/api/directory/ARXIV_GROW","skill":"/api/directory/ARXIV_GROW?format=skill","oip_contract":"/api/dispatch?key=ARXIV_GROW"}},{"key":"ARXIV_PAPER","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: The arXiv paper as a live object. The paper \"The Document Is the Receipt\" lives at github.com/massoumicyrus/oip (private) and is written only by ARXIV_GROW. Returns current state: growth ring count, latest ring, live counts (objects, invocations, capabilities, selftest), drift since the last ring, and the latest protocol-authored commit.\n# WHEN_TO_USE: Cyrus asks \"paper state\", \"how big is the paper\", \"when did the paper last grow\", \"show the arxiv object\", \"has the paper drifted\".\n# ARGS: none.\n# EX: [ARXIV_PAPER][/ARXIV_PAPER]\n[]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/ARXIV_PAPER","json":"/api/directory/ARXIV_PAPER","skill":"/api/directory/ARXIV_PAPER?format=skill","oip_contract":"/api/dispatch?key=ARXIV_PAPER"}},{"key":"CAP_MINT","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Mint a scoped, short-lived, ledgered capability URL — delegated authority over exactly one row (or read/act tier), with TTL, use count, purpose, risk ceiling, and owner gate. Returns invoke_url + explain_url + fingerprint; the URL explains itself.\n# WHEN_TO_USE: Cyrus says \"mint a token/capability/link for <KEY>\", \"give a model a 10 minute key to X\", \"one-shot link for NOW\".\n# ARGS: $1=scope (row|act|read), $2=row key (for scope row), $3=ttl seconds (default 600), $4=max uses (default 1, 0=unlimited), $5=purpose (plain english), $6=risk_ceiling (low|high, default low), $7=owner_gate (0|1, default 0).\n# EX: [CAP_MINT]row|NOW|600|1|demo for chatgpt[/CAP_MINT]\n[\"$1\",\"$2\",\"$3\",\"$4\",\"$5\",\"$6\",\"$7\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/CAP_MINT","json":"/api/directory/CAP_MINT","skill":"/api/directory/CAP_MINT?format=skill","oip_contract":"/api/dispatch?key=CAP_MINT"}},{"key":"GITHUB_TAIL","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: The GitHub repository as a live object. Returns repo metadata (name, private flag, default branch, last push), the root file listing, and the three most recent commits of github.com/massoumicyrus/oip. Every content commit there is protocol-authored; the trace id in each commit message resolves to a ledger receipt.\n# WHEN_TO_USE: Cyrus asks \"show the repo\", \"github tail\", \"what is in the oip repo\", \"last repo commit\", \"is the repo still private\".\n# ARGS: none.\n# EX: [GITHUB_TAIL][/GITHUB_TAIL]\n[]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/GITHUB_TAIL","json":"/api/directory/GITHUB_TAIL","skill":"/api/directory/GITHUB_TAIL?format=skill","oip_contract":"/api/dispatch?key=GITHUB_TAIL"}},{"key":"OIP_RECEIPT","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Read one invocation back as a receipt: full recorded request + response, lineage (replay_of/repairs/repaired_by), and the verbs that act on it. A receipt is a live replayable object, not history.\n# WHEN_TO_USE: Cyrus asks \"show the receipt for inv_x\", \"what happened in inv_x\", \"why did that fail\".\n# ARGS: $1 = invocation id (inv_…).\n# EX: [OIP_RECEIPT]inv_wvitbmiym6[/OIP_RECEIPT]\n[\"$1\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/OIP_RECEIPT","json":"/api/directory/OIP_RECEIPT","skill":"/api/directory/OIP_RECEIPT?format=skill","oip_contract":"/api/dispatch?key=OIP_RECEIPT"}},{"key":"OIP_REPAIR","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Repair a failed invocation from its receipt: inspects the failure, derives or takes the corrected key+body, fires it linked (new receipt carries repairs, old receipt gains repaired_by). Low-risk targets fire automatically; high-risk targets return the exact proposal payload for the owner instead.\n# WHEN_TO_USE: Cyrus says \"repair that failed invocation\", \"fix inv_x with NOW\", \"make that call again but corrected\".\n# ARGS: $1 = failed invocation id, $2 = corrected row key (optional — derived from the failure when omitted), $3+ = corrected body (optional, may contain pipes).\n# EX: [OIP_REPAIR]inv_6ximjestte|NOW|[/OIP_REPAIR]\n[\"$1\",\"$2\",\"$3+\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/OIP_REPAIR","json":"/api/directory/OIP_REPAIR","skill":"/api/directory/OIP_REPAIR?format=skill","oip_contract":"/api/dispatch?key=OIP_REPAIR"}},{"key":"OIP_REPLAY","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Re-fire a past invocation with its recorded input. New receipt links replay_of to the old one.\n# WHEN_TO_USE: Cyrus says \"replay that\", \"run inv_x again\", \"re-fire it as it was\".\n# ARGS: $1 = invocation id (inv_…).\n# EX: [OIP_REPLAY]inv_wvitbmiym6[/OIP_REPLAY]\n[\"$1\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/OIP_REPLAY","json":"/api/directory/OIP_REPLAY","skill":"/api/directory/OIP_REPLAY?format=skill","oip_contract":"/api/dispatch?key=OIP_REPLAY"}},{"key":"CAP_EXPLAIN","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Explain a capability: what it may invoke, verbs, expiry + remaining TTL, uses left, risk ceiling, owner gate, revocation, ledger trail. Accepts the token itself (sh.…) or its fingerprint (cap_…). Never echoes the raw token.\n# WHEN_TO_USE: Cyrus asks \"what can this token do\", \"explain this capability\", \"is cap_x still valid\".\n# ARGS: $1 = capability token or cap_ fingerprint.\n# EX: [CAP_EXPLAIN]cap_1a2b3c4d5e6f7a8b[/CAP_EXPLAIN]\n[\"$1\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/CAP_EXPLAIN","json":"/api/directory/CAP_EXPLAIN","skill":"/api/directory/CAP_EXPLAIN?format=skill","oip_contract":"/api/dispatch?key=CAP_EXPLAIN"}},{"key":"CAP_REVOKE","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Revoke a capability by fingerprint — the URL dies immediately; further invokes are denied and ledgered.\n# WHEN_TO_USE: Cyrus says \"revoke that token\", \"kill cap_x\", \"cut that model off\".\n# ARGS: $1 = cap_ fingerprint.\n# EX: [CAP_REVOKE]cap_1a2b3c4d5e6f7a8b[/CAP_REVOKE]\n[\"$1\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/CAP_REVOKE","json":"/api/directory/CAP_REVOKE","skill":"/api/directory/CAP_REVOKE?format=skill","oip_contract":"/api/dispatch?key=CAP_REVOKE"}}]},"ontology":{"conformance_group":"article","inferred_from":["philosophy","oip","convergence-catalogue","node","systems-theory","oip","node","c20","universal","computation"],"relationships":[],"sources":[]},"conformance":{"success_events":"/api/articles/oip-node-c20-universal-computation/invocations?status=success","failure_events":"/api/articles/oip-node-c20-universal-computation/invocations?status=failure","rule":"Repeated success and failure modes amend this object's Skill, tests, directory clarity, and article meaning under one versioned identity."},"article":{"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"],"category":null,"model":"Fable 5 (Claude Code)","ledger":{"href":"/api/articles/oip-node-c20-universal-computation/ledger","live":true},"embeds":[],"widgets":[],"home":true,"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.","evidence_basis":"atomized","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0}},{"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.","evidence_basis":"atomized","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0}},{"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.","evidence_basis":"atomized","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0}},{"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.","evidence_basis":"atomized","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0}},{"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.","evidence_basis":"atomized","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0}},{"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.","evidence_basis":"atomized","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0}}],"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}},"has_traversal":false,"register":"oip_protocol","status":"published","revisions":2,"contributions":[{"seq":0,"id":"k1","ts":"2026-07-07T07:53:51.321Z","model":"grok/grok-4.3","role":"atomizer","action":"atomize","payload":{"claims":[{"id":"c1","text":"One abstract machine (Turing machine / lambda calculus) can simulate any other.","tier":"mechanistic"},{"id":"c2","text":"Some physical processes are computationally irreducible — no shortcut to their outcome exists.","tier":"mechanistic"},{"id":"c3","text":"Any effectively calculable function is computable by a Turing machine.","tier":"mechanistic"},{"id":"c4","text":"A single machine exists that can simulate any other Turing machine given its description and input.","tier":"mechanistic"},{"id":"c5","text":"For some systems the only way to determine the outcome is to run the full computation with no predictive compression existing.","tier":"mechanistic"},{"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.","tier":"anecdotal"}]},"rationale":"schema conformance: body left untouched, claims atomized","tokens_in":3395,"tokens_out":1940,"cost":0.00909375,"prev_hash":"genesis","hash":"cd13c9040336fae8d635a2301f402f0b4bc29eaa8a44d93a8252936cafe0500e"}],"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"},{"ts":"2026-07-07T07:53:51.321Z","model":"grok/grok-4.3","action":"atomize","prompt":"You are the claim atomizer for the miscsubjects.com philosophy and OIP corpus. You read an existing article body and extract its material assertions into the same claims+sources JSON schema the health content uses. The body is read-only input.\n\nALWAYS:\n- Extract every material assertion as one atomic claim, tied to the ## section it came from.\n- Tier honestly: human = empirically established; mechanistic = formally proven or mathematical; anecdotal = historical or textual attribution; speculative = metaphysical or interpretive.\n- Attach real sources (primary works, papers, books) with exact quotes only where you can verify them; otherwise mark the claim unsourced.\n- Prefer fewer, harder claims over many soft ones.\n\nNEVER:\n- Never rewrite, summarize, or output the body.\n- Never invent a URL, quote, or publication.\n- Never duplicate an existing claim text.","input":"atomize oip-node-c20-universal-computation","response":"{\n  \"claims\": [\n    {\n      \"id\": \"c1\",\n      \"text\": \"One abstract machine (Turing machine / lambda calculus) can simulate any other.\",\n      \"section\": \"## C20 — Universal Computation\",\n      \"tier\": \"mechanistic\",\n      \"source_ids\": [],\n      \"source_status\": \"unsourced\",\n      \"why_material\": \"Core definition of universality in computation.\"\n    },\n    {\n      \"id\": \"c2\",\n      \"text\": \"Some physical processes are computationally irreducible — no shortcut to their outcome exists.\",\n      \"section\": \"## C20 — Universal Computation\",\n      \"tier\": \"mechanistic\",\n      \"source_ids\": [],\n      \"source_status\": \"unsourced\",\n      \"why_material\": \"States computational irreducibility as a property of certain systems.\"\n    },\n    {\n      \"id\": \"c3\",\n      \"text\": \"Any effectively calculable function is computable by a Turing machine.\",\n      \"section\": \"## C20 — Universal Computation\",\n      \"tier\": \"mechanistic\",\n      \"source_ids\": [],\n      \"source_status\": \"unsourced\",\n      \"why_material\": \"States the Church-Turing thesis.\"\n    },\n    {\n      \"id\": \"c4\",\n      \"text\": \"A single machine exists that can simulate any other Turing machine given its description and input.\",\n      \"section\": \"## C20 — Universal Computation\",\n      \"tier\": \"mechanistic\",\n      \"source_ids\": [],\n      \"source_status\": \"unsourced\",\n      \"why_material\": \"Defines the universal Turing machine.\"\n    },\n    {\n      \"id\": \"c5\",\n      \"text\": \"For some systems the only way to determine the outcome is to run the full computation with no predictive compression existing.\",\n      \"section\": \"## C20 — Universal Computation\",\n      \"tier\": \"mechanistic\",\n      \"source_ids\": [],\n      \"source_status\": \"unsourced\",\n      \"why_material\": \"States computational irreducibility per Wolfram from cellular automata.\"\n    },\n    {\n      \"id\": \"c6\",\n      \"text\": \"Church (1936), Turing (1936), von Neumann (1945), and Wolfram (2002) provide four independent derivations of universal simulation from logic, mathemati","tokens_in":3395,"tokens_out":1940,"cost":0,"prev":"d8678c6a2832adc3a4db4bfa7d707e7918c4b6777f565030592ddcead0dbc7c9","hash":"e1a5a4df7489da4bebfb88688f70e43cff304e1aa8b674d9047f7fef02dba3e9"},{"ts":"2026-07-07T07:53:51.637Z","model":"scorer","action":"score","prompt":"","input":"oip-node-c20-universal-computation","response":"[]","tokens_in":0,"tokens_out":0,"cost":0,"prev":"e1a5a4df7489da4bebfb88688f70e43cff304e1aa8b674d9047f7fef02dba3e9","hash":"963fa920010da98bee292991fbec0a13da4989a0630d1f085126bcee4385e9ad"},{"ts":"2026-07-17T02:36:22.486Z","model":"owner","action":"voxel_divide","prompt":"","input":"oip-node-c20-universal-computation","response":"5 DIVs from body (verbatim, roundtrip-checked)","tokens_in":0,"tokens_out":0,"cost":0,"prev":"963fa920010da98bee292991fbec0a13da4989a0630d1f085126bcee4385e9ad","hash":"788fa832cb2b53d7ad9a8ee14ebb3dd4be650b9c478aa03757a306aeaad8476e"}],"energy":{"passes":5,"tokens_in":3395,"tokens_out":1940,"tokens_total":5335,"cost_usd":0,"models":{"claude-fable-5":2,"grok/grok-4.3":1,"scorer":1,"owner":1},"head":"788fa832cb2b53d7ad9a8ee14ebb3dd4be650b9c478aa03757a306aeaad8476e"},"posted_at":"2026-07-04T02:47:57.936Z","created_at":"2026-07-04T02:47:57.936Z","updated_at":"2026-07-17T02:36:22.486Z","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":6,"sources":0,"contributions":1,"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))'"}},"representations":{"article":"/a/oip-node-c20-universal-computation","json":"/api/articles/oip-node-c20-universal-computation","markdown":"/api/articles/oip-node-c20-universal-computation/bundle?format=markdown","skill":"/api/articles/oip-node-c20-universal-computation/skill","topology":"/api/articles/oip-node-c20-universal-computation/topology","versions":"/api/articles/oip-node-c20-universal-computation/revisions","invocations":"/api/articles/oip-node-c20-universal-computation/invocations"}}}}