{
  "schema": "https://miscsubjects.com/schemas/jarticle.json",
  "status": "published",
  "slug": "turing-1936",
  "title": "Turing 1936 — On Computable Numbers",
  "kind": "source",
  "summary": "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. Some problems cannot be solved by",
  "created": "2026-07-04T20:40:57.605Z",
  "body": [
    "## The Source\n\nTuring, 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.\n\n## The Claim\n\nSome 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.\n\n## The Context\n\nHilbert 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.\n\nThe 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.\n\n## The Evidence\n\nTuring 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]\n\nTuring 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]\n\nThen 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]\n\nThe Entscheidungsproblem falls immediately. If you cannot determine whether a machine halts, you cannot determine whether a theorem is provable. The limit is absolute.\n\n## The Convergence\n\nThis source instantiates **C20 — Universal Computation**. [SOURCE:turing-1936|type:mathematical]\n\nTuring's machine is the abstract structure that underlies every computer. One machine simulates all others. This is not metaphor. It is theorem.\n\nThe 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.\n\nThe 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.\n\n## The Honest Limits\n\nTuring 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]\n\nTuring 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.\n\nHis machine has infinite tape. Real machines have finite memory. The idealization matters for some proofs.\n\nThe Church-Turing thesis is a hypothesis about physics, not a theorem. It may fail at quantum or biological scales. [SOURCE:turing-1936|type:theoretical]\n\n## The Receipt\n\n\"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'.\"\n\nThis is §1 of the paper. Turing constructs the machine from scratch.\n\nThe diagonal argument, in his own words:\n\n\"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...\"\n\nThe machine D, applied to itself, produces a contradiction. Therefore D cannot exist. The receipt is complete. [SOURCE:turing-1936|type:mathematical]\n\n## Related Sources\n\n- [SOURCE:church-1936|type:mathematical] — Alonzo Church proved the same undecidability independently via lambda calculus\n- [SOURCE:godel-1931|type:mathematical] — Gödel's incompleteness theorems set the stage for Turing's limit\n- [SOURCE:post-1936|type:mathematical] — Emil Post arrived independently with finite combinatory processes\n- [SOURCE:von-neumann-1945|type:empirical] — Von Neumann built the stored-program computer architecture from Turing's blueprint\n- [SOURCE:shannon-1948|type:theoretical] — Shannon's information theory completes the triad: computable, communicable, compressible\n- [SOURCE:prigogine-1977|type:empirical] — Dissipative structures push against the same limits: what can be computed versus what can exist"
  ],
  "facts": {
    "converted_from": "markdown",
    "original_updated": "2026-07-04T20:42:05.520Z",
    "register": "source",
    "category": null
  },
  "sources": [
    {
      "id": "turing-1936",
      "type": "primary",
      "url": "https://miscsubjects.com/a/turing-1936",
      "title": "On Computable Numbers, with an Application to the Entscheidungsproblem (1936)",
      "quote": "",
      "summary": "Turing proved that a single abstract machine can simulate any other computable machine. This is the foundational theorem of computer science. The halting problem is undecidable. The Church-Turing thesis is introduced as a hypothesis.",
      "claim_ids": [
        "c1",
        "c2",
        "c7",
        "c8"
      ],
      "quality_score": 1
    },
    {
      "id": "godel-1931",
      "type": "primary",
      "url": "https://miscsubjects.com/a/godel-1931",
      "title": "On Formally Undecidable Propositions of Principia Mathematica and Related Systems (1931)",
      "quote": "",
      "summary": "Gödel proved that any formal system powerful enough to express arithmetic is either incomplete or inconsistent. Truth exceeds proof. This sets the logical limit within which computation operates.",
      "claim_ids": [],
      "quality_score": 1
    },
    {
      "id": "shannon-1948",
      "type": "primary",
      "url": "https://miscsubjects.com/a/shannon-1948",
      "title": "A Mathematical Theory of Communication (1948)",
      "quote": "",
      "summary": "Shannon unified communication, cryptography, and computation in one framework. The bit is the unit of information. Information has a rate and a limit. The same math governs telegraphs, genes, and neurons.",
      "claim_ids": [
        "c5"
      ],
      "quality_score": 1
    },
    {
      "id": "landauer-1961",
      "type": "primary",
      "url": "https://miscsubjects.com/a/landauer-1961",
      "title": "Irreversibility and Heat Generation in the Computing Process (1961)",
      "quote": "",
      "summary": "Landauer proved that erasing one bit of information requires at least kT ln 2 of energy. Computation is physical. Information is physical. There is no free computation.",
      "claim_ids": [
        "c3",
        "c5"
      ],
      "quality_score": 0.95
    },
    {
      "id": "prigogine-1977",
      "type": "primary",
      "url": "https://miscsubjects.com/a/prigogine-1977",
      "title": "Self-Organization in Nonequilibrium Systems (1977)",
      "quote": "",
      "summary": "Prigogine showed that open systems far from equilibrium spontaneously organize into dissipative structures. These structures maintain order by exporting entropy. Observed in chemistry, biology, and meteorology.",
      "claim_ids": [
        "c4",
        "c5"
      ],
      "quality_score": 0.9
    }
  ],
  "claims": [
    {
      "id": "test-claim-1",
      "text": "Test claim",
      "tier": "system",
      "source_ids": [],
      "evidence_basis": "provided_document",
      "materiality": true,
      "weight": 1,
      "status": "active",
      "falsifier": "none"
    }
  ],
  "type": "article",
  "updated": "2026-10-08T11:35:15.912Z",
  "version": 1,
  "hash": "1d721ef50908c8fd228e602b4f1c1db0daa7f7b472ed73d14fae965429d2f488",
  "styling": {
    "scope": "shared",
    "how": "no value on the page is set by hand: each comes from this theme, and each theme value becomes the CSS variable named beside it. PATCH https://miscsubjects.com/api/jarticles/theme changes them.",
    "widget_style": {
      "what": "every widget may carry style: {…}; these are the only keys it reads",
      "rotate": "degrees, a number",
      "offset_x": "pixels, a number",
      "offset_y": "pixels, a number",
      "pulse": "true to pulse"
    },
    "theme": {
      "color": {
        "page_bg": "#f5f5f7",
        "sheet_bg": "#ffffff",
        "ink": "#1d1d1f",
        "soft": "#424245",
        "muted": "#6e6e73",
        "dim": "#86868b",
        "line": "#d2d2d7",
        "accent": "#0071e3",
        "accent_soft": "rgba(0,113,227,0.08)",
        "link": "#0066cc",
        "selection": "rgba(0,113,227,0.18)",
        "widget_bg": "#f5f5f7",
        "widget_border": "#d2d2d7",
        "card_bg": "#ffffff",
        "code_bg": "#f5f5f7",
        "json_bg": "#161b19",
        "json_ink": "#e6e1d4",
        "json_key": "#7fd3c3",
        "json_string": "#e9c46a",
        "json_number": "#f4a261",
        "json_bool": "#c792ea",
        "json_null": "#928d7e",
        "json_punct": "#6b6759",
        "json_bar": "#0e1512",
        "kind_badge_bg": "#0e6e60",
        "kind_badge_ink": "#ffffff"
      },
      "color_dark": {
        "page_bg": "#000000",
        "sheet_bg": "#1d1d1f",
        "ink": "#f5f5f7",
        "soft": "#d2d2d7",
        "muted": "#a1a1a6",
        "dim": "#86868b",
        "line": "#424245",
        "accent": "#2997ff",
        "accent_soft": "rgba(41,151,255,0.12)",
        "link": "#2997ff",
        "selection": "rgba(41,151,255,0.25)",
        "widget_bg": "#2c2c2e",
        "widget_border": "#424245",
        "card_bg": "#1d1d1f",
        "code_bg": "#2c2c2e",
        "json_bg": "#0a0d0c",
        "json_ink": "#e6e1d4",
        "json_key": "#7fd3c3",
        "json_string": "#e9c46a",
        "json_number": "#f4a261",
        "json_bool": "#c792ea",
        "json_null": "#757062",
        "json_punct": "#5d665f",
        "json_bar": "#060807",
        "kind_badge_bg": "#4fc1ab",
        "kind_badge_ink": "#0b0f0d"
      },
      "font": {
        "display": "-apple-system,BlinkMacSystemFont,\"SF Pro Display\",\"SF Pro Text\",\"Helvetica Neue\",Helvetica,Arial,sans-serif",
        "body": "-apple-system,BlinkMacSystemFont,\"SF Pro Display\",\"SF Pro Text\",\"Helvetica Neue\",Helvetica,Arial,sans-serif",
        "mono": "ui-monospace,SFMono-Regular,\"SF Mono\",Menlo,Consolas,monospace",
        "google_fonts": ""
      },
      "size": {
        "body": "17px",
        "small": "17px",
        "eye": "17px",
        "lead": "17px",
        "h1": "52px",
        "h2": "34px",
        "h3": "22px",
        "byline": "17px",
        "h1_measure": "none",
        "code": "17px",
        "json": "17px",
        "widget_title": "17px"
      },
      "leading": {
        "body": "1.7",
        "head": "1.18",
        "lead": "1.5",
        "json": "1.6"
      },
      "weight": {
        "display": "700",
        "head": "700",
        "body": "400",
        "strong": "700",
        "eye": "700"
      },
      "tracking": {
        "eye": "0.14em",
        "display": "-0.03em",
        "body": "-0.006em",
        "badge": "0.08em"
      },
      "layout": {
        "sheet_width": "1000px",
        "text_width": "880px",
        "gutter": "16px",
        "sheet_padding": "56px 64px 64px",
        "sheet_padding_mobile": "24px 18px 40px",
        "sheet_margin": "28px auto 72px",
        "block_gap": "1.15em",
        "widget_gap": "28px",
        "grid_gap": "14px"
      },
      "border": {
        "sheet": "0px solid",
        "sheet_radius": "30px",
        "widget": "1px solid",
        "widget_radius": "24px",
        "card_radius": "24px",
        "badge_radius": "999px",
        "rule": "1px solid",
        "code_radius": "18px",
        "accent_bar": "3px"
      },
      "shadow": {
        "sheet": "0 1px 1px rgba(0,0,0,.02),0 6px 26px rgba(0,0,0,.05)",
        "widget": "none",
        "card_hover": "0 10px 28px -16px rgba(28,27,23,0.35)"
      },
      "motion": {
        "hover": "160ms ease"
      }
    }
  },
  "page": "https://miscsubjects.com/a/turing-1936",
  "json": "https://miscsubjects.com/a/turing-1936.json",
  "markdown": "https://miscsubjects.com/a/turing-1936.md",
  "theme": "https://miscsubjects.com/article-theme.json",
  "calls": [
    {
      "what": "this article as a page (no key)",
      "method": "GET",
      "url": "https://miscsubjects.com/a/turing-1936",
      "headers": {}
    },
    {
      "what": "this article as its object (no key)",
      "method": "GET",
      "url": "https://miscsubjects.com/a/turing-1936.json",
      "headers": {}
    },
    {
      "what": "this article as Markdown (no key)",
      "method": "GET",
      "url": "https://miscsubjects.com/a/turing-1936.md",
      "headers": {}
    },
    {
      "what": "the object with its hash, drafts too",
      "method": "GET",
      "url": "https://miscsubjects.com/api/jarticles/turing-1936",
      "headers": {
        "x-sheets-key": "$(cat /Users/cyrusmassoumi/.misc-sheets-key)"
      }
    },
    {
      "what": "one piece and that piece’s hash",
      "method": "GET",
      "url": "https://miscsubjects.com/api/jarticles/turing-1936/at?path=facts",
      "headers": {
        "x-sheets-key": "$(cat /Users/cyrusmassoumi/.misc-sheets-key)"
      }
    },
    {
      "what": "grep: every key or value that matches, with the path to change it",
      "method": "GET",
      "url": "https://miscsubjects.com/api/jarticles/turing-1936/grep?q=owner",
      "headers": {
        "x-sheets-key": "$(cat /Users/cyrusmassoumi/.misc-sheets-key)"
      }
    },
    {
      "what": "change pieces (set, merge, delete, append, insert, move); if-match is the hash",
      "method": "PATCH",
      "url": "https://miscsubjects.com/api/jarticles/turing-1936",
      "headers": {
        "x-sheets-key": "$(cat /Users/cyrusmassoumi/.misc-sheets-key)",
        "content-type": "application/json",
        "if-match": "<hash from the read>"
      },
      "body": {
        "ops": [
          {
            "op": "set",
            "path": "facts.example",
            "value": 1
          }
        ]
      }
    },
    {
      "what": "replace the whole object",
      "method": "PUT",
      "url": "https://miscsubjects.com/api/jarticles/turing-1936",
      "headers": {
        "x-sheets-key": "$(cat /Users/cyrusmassoumi/.misc-sheets-key)",
        "content-type": "application/json",
        "if-match": "<hash>"
      },
      "body": {
        "slug": "turing-1936",
        "title": "…"
      }
    },
    {
      "what": "fetch every source, hash what came back and check the quote is in it",
      "method": "POST",
      "url": "https://miscsubjects.com/api/jarticles/turing-1936/verify",
      "headers": {
        "x-sheets-key": "$(cat /Users/cyrusmassoumi/.misc-sheets-key)",
        "content-type": "application/json"
      },
      "body": {}
    },
    {
      "what": "an Obsidian-style command",
      "method": "POST",
      "url": "https://miscsubjects.com/api/jarticles/cli",
      "headers": {
        "x-sheets-key": "$(cat /Users/cyrusmassoumi/.misc-sheets-key)",
        "content-type": "application/json"
      },
      "body": {
        "command": "backlinks",
        "file": "turing-1936"
      }
    }
  ]
}