Object Invocation Protocol · protocol specification

Node C20: Universal Computation

Posted Jul 4, 2026 · Updated Jul 17, 2026 · 2 min read

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 their outcome exists.", "domain": ["mathematical logic", "computer science", "theoretical physics", "cellular automata"], "pattern": ["universality", "Turing_completeness", "computational_irreducibility", "simulation"], "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.", "scale": "abstract → physical", "claim_tier": "T0 (core logic) / T3 (pancomputationalism)", "sources": [ "Church, A. (1936). 'An Unsolvable Problem of Elementary Number Theory.' Am. J. Math., 58, 345-363.", "Turing, A.M. (1936). 'On Computable Numbers, with an Application to the Entscheidungsproblem.' Proc. Lond. Math. Soc., 42, 230-265.", "von Neumann, J. (1945). 'First Draft of a Report on the EDVAC.' Moore School.", "Wolfram, S. (2002). A New Kind of Science. Wolfram Media. [Computational irreducibility, Rule 110.]" ], "dual": "Non-computable — a process that cannot be simulated by any Turing-equivalent machine; hypercomputation.", "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.)", "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.", "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.", "pattern_type": "mathematical", "maps_to_axiom": ["A3"] }

---

Corpus map

Same node, other planes: Encyclopedia C20 · Inventory invariant
Catalogue hub: Public Article · Schema

Key evidence

6 claims · tier-ranked · API

mechanistic

One abstract machine (Turing machine / lambda calculus) can simulate any other.

mechanistic

Some physical processes are computationally irreducible — no shortcut to their outcome exists.

mechanistic

Any effectively calculable function is computable by a Turing machine.

mechanistic

A single machine exists that can simulate any other Turing machine given its description and input.

mechanistic

For some systems the only way to determine the outcome is to run the full computation with no predictive compression existing.

anecdotal

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.

Model review1 contributions · 1 modelExpand the recursive review layer

1 / 1

grok/grok-4.3atomizer

atomize2026-07-07 07:53

atomize · 6 claims

inspect — what it was prompted & output

prompted with

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.

ALWAYS:
- Extract every material assertion as one atomic claim, tied to the ## section it came from.
- Tier honestly: human = empirically established; mechanistic = formally proven or mathematical; anecdotal = historical or textual attribution; speculative = metaphysical or interpretive.
- Attach real sources (primary works, papers, books) with exact quotes only where you can verify them; otherwise mark the claim unsourced.
- Prefer fewer, harder claims over many soft ones.

NEVER:
- Never rewrite, summarize, or output the body.
- Never invent a URL, quote, or publication.
- Never duplicate an existing claim text.

input: atomize oip-node-c20-universal-computation

it output

{
  "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."
    },

cd13c9040336fae8

Machine verification: /api/articles/oip-node-c20-universal-computation/contributions

Corpus map

Key evidence

Latest from the journal

Related articles