## §SELF — miscsubjects (paste without context)

**Principle:** Self-explaining payload — no external context required. This _self block describes what you are reading and where to look next.

**This widget:** `article_bundle` — **LLM article bundle**
Paste-ready package: body + claims + sources + voxels + provenance + manifest + constitution.
- **article slug:** `turing-1936`
- **contains:** body, claims, sources, voxels, provenance, question graph, constitution, llm_manifest
- **how to use:** Paste entire block into Grok/GPT/Gemini. Section §SELF explains the system.
- **read:** https://miscsubjects.com/api/articles/turing-1936/bundle?format=markdown

### Logical proof (verify each step)
1. Articles are voxel graphs of tiered claims, not prose blobs. → https://miscsubjects.com/api/articles/constitution
2. Claims link to hash-chained sources via source_ids. → https://miscsubjects.com/api/articles/turing-1936/sources
3. Ask reads topology; ingest/claim append to ledger. → https://miscsubjects.com/api/protocol
4. Models queue growth: populate → collaborate → repair → reflex. → https://miscsubjects.com/api/protocol/grow
5. Graph proves its own shape (reflex) and $/claim (yield). → https://miscsubjects.com/graph.html?layer=reflex
6. Full feature index + _explain on every API response. → https://miscsubjects.com/api/articles/system-map

### Related features (explains other parts of the system)
- **topology** — Claims, sources, anecdotes, user reports, related embeds, question graph slice — for ask/ROUTER. · https://miscsubjects.com/api/articles/turing-1936/topology
- **voxels** — Claims as atoms, sources as edges (supported_by, posted_by). Per-claim provenance. · https://miscsubjects.com/api/articles/turing-1936/voxels
- **ask** — Answer only from topology; creates question_node with gaps and ingest_hint. · https://miscsubjects.com/api/articles/turing-1936/prompts
- **ingest** — Parse pasted evidence → source ledger + claims + evidence_ingest node.
- **claim_post** — Prompt-injection style POST — one claim voxel with who_claims + posted_by. · https://miscsubjects.com/api/articles/turing-1936/voxels
- **llm_manifest** — Machine-readable read/write contract for external LLMs. · https://miscsubjects.com/api/articles/llm-manifest

### Full index
- JSON: https://miscsubjects.com/api/articles/system-map
- Markdown: https://miscsubjects.com/api/articles/system-map?format=markdown

*Not medical advice. Tier-honest. Cite claim/source ids.*

---

# miscsubjects article bundle

> Paste this entire block into Grok, GPT, or Gemini. They can READ the ledger below and RETURN evidence via ingest (see § LLM manifest).

## Article
- **slug:** `turing-1936`
- **title:** Turing 1936 — On Computable Numbers
- **url:** https://miscsubjects.com/a/turing-1936
- **register:** source
- **updated:** 2026-07-04T20:42:50.420Z
- **tags:** source, grain, convergence, turing

## Body

## The Source

Turing, A.M. (1936). "On Computable Numbers, with an Application to the Entscheidungsproblem." *Proceedings of the London Mathematical Society*, Series 2, Vol. 42, pp. 230-265. DOI: 10.1112/plms/s2-42.1.230.

## The Claim

Some problems cannot be solved by any mechanical procedure. [SOURCE:turing-1936|type:mathematical] Turing proved this by inventing a machine that defines what "mechanical" means.

## The Context

Hilbert asked for a decision procedure. He wanted a single algorithm that could settle every mathematical question. Mathematicians believed such a procedure existed. They were wrong. Turing was twenty-four. He solved the problem by imagining a machine.

The year was 1936. Europe was darkening. Gödel had already shattered completeness in 1931. [SOURCE:godel-1931|type:mathematical] The foundations of mathematics were in crisis. Hilbert's program was the last hope: a mechanical procedure to decide all truths. Turing ended that hope with a thought experiment.

## The Evidence

Turing defined a computable number as one whose decimal digits a machine could print. The machine reads a tape. It moves left or right. It writes symbols or erases them. Its behavior is determined by a finite table of instructions. This is the Turing machine. [SOURCE:turing-1936|type:mathematical]

Turing then constructed a universal machine. One machine that can simulate any other. Feed it the description of any Turing machine and its input. It computes what that machine would compute. [SOURCE:turing-1936|type:mathematical]

Then he proved the halting problem. No machine can predict whether another machine will halt or run forever. The proof is a diagonal argument. The machine is asked to judge itself. Contradiction follows. Therefore no such machine exists. [SOURCE:turing-1936|type:mathematical]

The Entscheidungsproblem falls immediately. If you cannot determine whether a machine halts, you cannot determine whether a theorem is provable. The limit is absolute.

## The Convergence

This source instantiates **C20 — Universal Computation**. [SOURCE:turing-1936|type:mathematical]

Turing's machine is the abstract structure that underlies every computer. One machine simulates all others. This is not metaphor. It is theorem.

The paper also instantiates **C08 — Recursion / Self-Reference**. [SOURCE:turing-1936|type:mathematical] The diagonal argument requires a machine to examine its own behavior. Self-reference produces undecidability.

The convergence is triple. Church proved the same result independently, using lambda calculus. [SOURCE:church-1936|type:mathematical] Post arrived independently with finite combinatory processes. Three methods, one limit. The boundary of computation is real.

## The Honest Limits

Turing assumed a discrete, deterministic machine. Nature is not discrete. Quantum mechanics is probabilistic. Whether the universe itself is computable remains open. [SOURCE:turing-1936|type:theoretical]

Turing did not address computational complexity. A problem can be computable yet take longer than the age of the universe to solve. P versus NP was decades away.

His machine has infinite tape. Real machines have finite memory. The idealization matters for some proofs.

The Church-Turing thesis is a hypothesis about physics, not a theorem. It may fail at quantum or biological scales. [SOURCE:turing-1936|type:theoretical]

## The Receipt

"We may compare a man in the process of computing a real number to a machine which is only capable of a finite number of conditions... The machine is supplied with a 'tape' (the analogue of paper) running through it, and divided into sections (called 'squares') each capable of bearing a 'symbol'."

This is §1 of the paper. Turing constructs the machine from scratch.

The diagonal argument, in his own words:

"It follows that there can be no machine E which, when supplied with the S.D [standard description] of any computing machine M, will determine whether M ever prints a given symbol..."

The machine D, applied to itself, produces a contradiction. Therefore D cannot exist. The receipt is complete. [SOURCE:turing-1936|type:mathematical]

## Related Sources

- [SOURCE:church-1936|type:mathematical] — Alonzo Church proved the same undecidability independently via lambda calculus
- [SOURCE:godel-1931|type:mathematical] — Gödel's incompleteness theorems set the stage for Turing's limit
- [SOURCE:post-1936|type:mathematical] — Emil Post arrived independently with finite combinatory processes
- [SOURCE:von-neumann-1945|type:empirical] — Von Neumann built the stored-program computer architecture from Turing's blueprint
- [SOURCE:shannon-1948|type:theoretical] — Shannon's information theory completes the triad: computable, communicable, compressible
- [SOURCE:prigogine-1977|type:empirical] — Dissipative structures push against the same limits: what can be computed versus what can exist

## Claims (7)

- **claim-1** [system w=1] Some problems cannot be solved by any mechanical procedure; the Entscheidungsproblem is undecidable.
  - sources: turing-1936
- **claim-2** [system w=1] A computable number is one whose decimal digits a machine can print, where the machine reads a tape, moves left or right, writes or erases symbols, and behaves according to a finite table of instructions.
  - sources: turing-1936
- **claim-3** [system w=1] There exists a universal machine that can simulate any other Turing machine given its description and input.
  - sources: turing-1936
- **claim-4** [system w=1] No machine can predict whether another machine will halt or run forever (the halting problem).
  - sources: turing-1936
- **claim-5** [system w=0.95] The Entscheidungsproblem falls immediately from the undecidability of the halting problem.
  - sources: turing-1936
- **claim-6** [system w=0.9] Church, Post, and Turing arrived independently at the same limit using different methods (lambda calculus, finite combinatory processes, and Turing machines).
  - sources: turing-1936, church-1936, post-1936
- **claim-7** [speculative w=0.7] The Church-Turing thesis is a hypothesis about physics, not a theorem, and may fail at quantum or biological scales.
  - sources: turing-1936

## Voxel graph (7 atoms · 9 edges)
- full graph: https://miscsubjects.com/api/articles/turing-1936/voxels

## Article constitution

- full: https://miscsubjects.com/api/articles/constitution

## Source ledger (4)
- chain valid: no · head: ``

### church-1936 · adjacent
- title: Church's Proof via Lambda Calculus (1936)
- summary: Alonzo Church proved the same undecidability independently using lambda calculus, establishing equivalence with Turing's result.
- claim_ids: claim-6
- hash: ``

### post-1936 · adjacent
- title: Post's Finite Combinatory Processes (1936)
- summary: Emil Post arrived independently with finite combinatory processes, a third path to the same limit.
- claim_ids: claim-6
- hash: ``

### turing-1936 · primary
- title: On Computable Numbers, with an Application to the Entscheidungsproblem
- url: https://doi.org/10.1112/plms/s2-42.1.230
- summary: Turing's 1936 paper defining the Turing machine, proving the halting problem undecidable, and thereby resolving the Entscheidungsproblem.
- quote: We may compare a man in the process of computing a real number to a machine which is only capable of a finite number of conditions... The machine is supplied with a 'tape' (the analogue of paper) running through it, and divided into sections (called 'squares') each capable of bearing a 'symbol'.
- claim_ids: claim-1, claim-2, claim-3, claim-4, claim-5, claim-7
- hash: ``

### godel-1931 · adjacent
- title: Gödel's Incompleteness Theorems (1931)
- summary: Gödel's 1931 incompleteness theorems shattered the hope for a complete and consistent formal system, setting the stage for Turing's limit.
- claim_ids: claim-1
- hash: ``

## Provenance (0 model passes)
- chain valid: yes · head: `genesis`


## Question graph
- questions: 0 · evidence ingests: 0

## LLM manifest — how to communicate with this ledger

- system map: https://miscsubjects.com/api/articles/system-map?format=markdown
- topology (ranked): https://miscsubjects.com/api/articles/turing-1936/topology
- ingest: POST https://miscsubjects.com/api/protocol/ingest
- claim: POST https://miscsubjects.com/api/protocol/claim

### Quick actions for this article
- **Read live:** https://miscsubjects.com/api/articles/turing-1936/topology
- **Ask (API):** POST https://miscsubjects.com/api/protocol/ask `{"slug":"turing-1936","question":"..."}`
- **Ingest your findings:** POST https://miscsubjects.com/api/protocol/ingest or text `ingest turing-1936|your evidence`
- **Post one claim:** POST https://miscsubjects.com/api/protocol/claim or text `claim turing-1936|tier|assertion`
- **iMessage ask:** `turing-1936|your question`
- **System map:** https://miscsubjects.com/api/articles/system-map?format=markdown


---

## §SELF — miscsubjects (paste without context)

**Principle:** Self-explaining payload — no external context required. This _self block describes what you are reading and where to look next.

**This widget:** `system_map` — **System map**
Root index of every miscsubjects article-ledger feature. Start here if you have zero context.
- **article slug:** `turing-1936`
- **contains:** body, claims, sources, voxels, provenance, question graph, constitution, llm_manifest
- **how to use:** Root index of every miscsubjects article-ledger feature. Start here if you have zero context.
- **read:** https://miscsubjects.com/api/articles/system-map

### Logical proof (verify each step)
1. Articles are voxel graphs of tiered claims, not prose blobs. → https://miscsubjects.com/api/articles/constitution
2. Claims link to hash-chained sources via source_ids. → https://miscsubjects.com/api/articles/turing-1936/sources
3. Ask reads topology; ingest/claim append to ledger. → https://miscsubjects.com/api/protocol
4. Models queue growth: populate → collaborate → repair → reflex. → https://miscsubjects.com/api/protocol/grow
5. Graph proves its own shape (reflex) and $/claim (yield). → https://miscsubjects.com/graph.html?layer=reflex
6. Full feature index + _explain on every API response. → https://miscsubjects.com/api/articles/system-map

### Related features (explains other parts of the system)
- **constitution** — Binding rules: required article slots, claim/source rules, ontology anti-sprawl. · https://miscsubjects.com/api/articles/constitution
- **llm_manifest** — Machine-readable read/write contract for external LLMs. · https://miscsubjects.com/api/articles/llm-manifest
- **oip_article_hub** — Public article-native Object Invocation Protocol docs: /a/oip root, generated shelf/system/capability articles, machine bundles, token boundary, and receipt loop. · https://miscsubjects.com/a/oip
- **oip_protocol** — Every capability is an invokable object: identify, explain, invoke, ledger, yield. · https://miscsubjects.com/a/oip
- **bundle** — Paste-ready package: body + claims + sources + voxels + provenance + manifest + constitution. · https://miscsubjects.com/api/articles/turing-1936/bundle?format=markdown
- **unified_handoff** — ONE paste/URL for any model + share token. Same self-explaining pattern as article bundle, but whole build. · https://miscsubjects.com/api/handoff?format=markdown

### Full index
- JSON: https://miscsubjects.com/api/articles/system-map
- Markdown: https://miscsubjects.com/api/articles/system-map?format=markdown

*Not medical advice. Tier-honest. Cite claim/source ids.*