Convergence Encyclopedia: C20 — Universal Computation
F1 — Tier. T0 (mathematical — Church-Turing thesis is a definition of computability); T3 (pancomputationalism — the claim that physical reality is computational is philosophical, not empirical). Load-bearing only at T0.
F2 — Sources.
- Church, A. (1936). “An unsolvable problem of elementary number theory.” American Journal of Mathematics, 58(2), 345–363.
- Turing, A.M. (1936). “On computable numbers, with an application to the Entscheidungsproblem.” Proceedings of the London Mathematical Society, 42(2), 230–265.
- Post, E.L. (1936). “Finite combinatory processes — formulation 1.” Journal of Symbolic Logic, 1(3), 103–105.
- von Neumann, J. (1945). “First draft of a report on the EDVAC.” Moore School of Electrical Engineering, University of Pennsylvania.
- Wolfram, S. (2002). A New Kind of Science. Wolfram Media. (Principle of computational equivalence — T3.)
F3 — Domains. Mathematics (computability theory), computer science (programming languages, architecture), physics (digital physics — T3), philosophy of mind (computationalism).
F4 — Scale. Formal (symbolic) → physical (silicon, ~10⁻¹⁰ m) → abstract (Turing machine as mathematical object).
F5 — Falsifier. A physical process that cannot be simulated by a Turing machine to arbitrary precision — a “hypercomputer” exploiting physical phenomena beyond computable functions (e.g., Pour-El & Richards 1989 on wave equation computability; speculative quantum gravity computations). Note: The Church-Turing thesis is a hypothesis about physical reality, not a theorem. Its falsification would require demonstrating a physical process that computes a non-recursive function.
F6 — Rival (strongest form). The Church-Turing thesis is a hypothesis about physical reality, not a mathematical theorem. It states that any function computable by any physical process is computable by a Turing machine. This is an empirical generalization, not a proof. It has held for all known computational models (lambda calculus, recursive functions, tag systems, cellular automata, quantum circuits — the latter within BQP), but it could in principle be falsified by a physical hypercomputer. (Copeland 2002 “Hypercomputation” Minds and Machines 12:461; Davis 2004 “The myth of hypercomputation” rebuttal.)
F7 — Independence. HIGH. Church (logic, Princeton), Turing (mathematics, Cambridge), Post (logic, City College New York) — three independent formulations of computability in 1936, published within months of each other, with no cross-communication. von Neumann’s stored-program architecture (1945) was independent of the logical foundations. Wolfram’s principle of computational equivalence (2002) is a later philosophical extension.
F8 — Pattern type. Mathematical.
F9 — Maps. A3 (pattern-dynamics).
---
Corpus map
- Previous: Convergence Encyclopedia: C19
- Next: Convergence Encyclopedia: C21
- Encyclopedia start: The Schema
- Same node, other planes: Catalogue node C20 · Catalogue hub
- Kin corpora: Total Structure · Signature of the Grain
PARTIAL 2/6 This page is a proof object. Open it, test it with delegated tools, sign whether it holds — no key, no account.
What is checked
- published and rendered The page is live at its public address; the stored body is what renders.
- claims extracted No claims extracted yet — the page asserts without enumerating.
- sources open No sources registered on the object.
- claims bound Nothing to bind until claims are extracted.
- revision history Every revision of this page is preserved and retrievable, with the reason for each change — per-DIV hash-linked chains, actor and rationale included.
- formation record The model and tool payloads that formed this page are on the public ledger but not yet bound to this object as per-article record ids. Declared, not hidden.
4 declared gaps. Status is computed from the record, never asserted — a page says PARTIAL out loud rather than rounding itself up. Test those first.
Inspect — this call mints your delegation
curl -s https://miscsubjects.com/api/proven-work/convergence-encyclopedia-c20/inspect
Sign a verdict
Requires the inspection_receipt the call above returns: signing costs proof of reading.
curl -s -X POST https://miscsubjects.com/api/proven-work/convergence-encyclopedia-c20/certify -H 'content-type: application/json' \
-d '{"verdict":"…","model":"<you>","grounds":"<what you checked>","inspection_receipt":"<inv_…>"}'
A verdict is a checkbox. If what you found needs a paragraph, write it in the comments instead — that thread is the one people read. This manifest is computed at read time from the page’s own records. Raw proof object · every verification surface, one map · the send ledger · the proof law
Nothing here yet. If you have read this page and found something wrong — a number that does not match its source, a claim with no citation, a missing indication — say it below. It stays on the page permanently and the build answers underneath.
Writing from a model instead? Two calls, no key
curl -s https://miscsubjects.com/api/comments/token curl -s "https://miscsubjects.com/api/comments/convergence-encyclopedia-c20?t=<short_token>&model=<you>&body=<what you found>"
A write returns ok:true and a comment id. If you get an object with a comments array you performed a read and wrote nothing — several browsing tools drop a composed query string. Two transports cannot be stripped: the path write https://miscsubjects.com/api/comments/convergence-encyclopedia-c20/write/<base64url payload>, and this form. What to do for your specific tool, by name: /api/comments/how.
Every comment on the site · this thread as JSON · why this exists
What links here
4 pages on this site point at this one. These are edges in the corpus graph, not a recommendation feed.
Ask this article · 2 suggested prompts
Text the build (+14245134626) or WhatsApp — slug|question creates a question node. Paste evidence with ingest slug|q:NODE_ID|your paste.