Object Invocation Protocol · protocol specification

Invariant 3.20 — Universal computation

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

One machine can simulate any other; some processes are computationally irreducible. Sources: Church, Turing; von Neumann; Wolfram (irreducibility — T2/T3); Conway. Domains: computation, (contested) physics and biology. Dual: non-computable. Tier: T0 (core) / T3 (pancomputationalism). Falsifier: a physical process provably non-simulable by any Turing machine. Maps: A₃.

---

Corpus map

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

Key evidence

6 claims · tier-ranked · API

mechanistic

One machine can simulate any other.

mechanistic

Some processes are computationally irreducible.

mechanistic

Dual is non-computable.

mechanistic

Falsifier is a physical process provably non-simulable by any Turing machine.

anecdotal

Same invariant exists on other planes including Catalogue node C20 and Encyclopedia C20.

anecdotal

Inventory hub is Convergence Catalogue — Public Article.

Model review1 contributions · 1 modelExpand the recursive review layer

1 / 1

grok/grok-4.3atomizer

atomize2026-07-07 08:08

atomize · 8 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-invariant-20-320-universal-computation

it output

{
  "claims": [
    {
      "id": "c1",
      "text": "One machine can simulate any other.",
      "section": "## 3.20 Universal computation",
      "tier": "mechanistic",
      "source_ids": [],
      "source_status": "unsourced",
      "why_material": "Core statement of universal computation."
    },
    {
      "id": "c2",
      "text": "Some processes are computationally irreducible.",
      "section": "## 3.20 Universal computation",
      "tier": "mechanistic",
      "source_ids": [],
      "source_status": "unsourced",
      "why_material": "Establishes computational irreducibility as a property."
    },
    {
      "id": "c3",
      "text": "Domains are computation, (contested) physics and biology.",
      "section": "## 3.20 Universal computation",
      "tier": "speculative",
      "source_ids": [],
      "source_status": "unsourced",
      "why_material": "Specifies application domains."
    },
    {
      "id": "c4",
      "text": "Dual is non-computable.",
      "section": "## 3.20 Universal computation",
      "tier": "mechanistic",
      "source_ids": [],
      "source_status": "unsourced",
      "why_material": "Defines the logical dual."
    },
    {
      "id": "c5",
      "text": "Falsifier is a physical process provably non-simulable by any Turing machine.",
      "section": "## 3.20 Universal computation",
      "tier": "mechanistic",
      "source_ids": []

bebe7a04df383a56

Machine verification: /api/articles/oip-invariant-20-320-universal-computation/contributions

Corpus map

Key evidence

Latest from the journal

Related articles