{"_self":{"principle":"Self-explaining payload — no external context required. This _self block describes what you are reading and where to look next.","widget":"article_bundle","feature":"bundle","name":"LLM article bundle","what":"Paste-ready package: body + claims + sources + voxels + provenance + manifest + constitution.","contains":"body, claims, sources, voxels, provenance, question graph, constitution, llm_manifest","slug":"turing-1936","urls":{"read":"https://miscsubjects.com/api/articles/turing-1936/bundle?format=markdown"},"how_to_use":"Paste into any LLM. Read §SELF first. Write back via ingest or claim endpoints in llm_manifest.","write":null,"imessage":null,"router_tag":null,"proof_chain":[{"step":1,"claim":"Articles are voxel graphs of tiered claims, not prose blobs.","verify":"https://miscsubjects.com/api/articles/constitution"},{"step":2,"claim":"Claims link to hash-chained sources via source_ids.","verify":"https://miscsubjects.com/api/articles/turing-1936/sources"},{"step":3,"claim":"Ask reads topology; ingest/claim append to ledger.","verify":"https://miscsubjects.com/api/protocol"},{"step":4,"claim":"Models queue growth: populate → collaborate → repair → reflex.","verify":"https://miscsubjects.com/api/protocol/grow"},{"step":5,"claim":"Graph proves its own shape (reflex) and $/claim (yield).","verify":"https://miscsubjects.com/graph.html?layer=reflex"},{"step":6,"claim":"Full feature index + _explain on every API response.","verify":"https://miscsubjects.com/api/articles/system-map"}],"related_features":[{"id":"topology","name":"Article topology","what":"Claims, sources, anecdotes, user reports, related embeds, question graph slice — for ask/ROUTER.","urls":{"read":"https://miscsubjects.com/api/articles/turing-1936/topology"}},{"id":"voxels","name":"Voxel graph","what":"Claims as atoms, sources as edges (supported_by, posted_by). Per-claim provenance.","urls":{"read":"https://miscsubjects.com/api/articles/turing-1936/voxels","write":"https://miscsubjects.com/api/protocol/claim"}},{"id":"ask","name":"Ask protocol","what":"Answer only from topology; creates question_node with gaps and ingest_hint.","urls":{"read":"https://miscsubjects.com/api/articles/turing-1936/prompts","write":"https://miscsubjects.com/api/protocol/ask"}},{"id":"ingest","name":"Ingest protocol","what":"Parse pasted evidence → source ledger + claims + evidence_ingest node.","urls":{"write":"https://miscsubjects.com/api/protocol/ingest"}},{"id":"claim_post","name":"Claim post protocol","what":"Prompt-injection style POST — one claim voxel with who_claims + posted_by.","urls":{"read":"https://miscsubjects.com/api/articles/turing-1936/voxels","write":"https://miscsubjects.com/api/protocol/claim"}},{"id":"llm_manifest","name":"LLM manifest","what":"Machine-readable read/write contract for external LLMs.","urls":{"read":"https://miscsubjects.com/api/articles/llm-manifest"}}],"system_map":"https://miscsubjects.com/api/articles/system-map","system_map_markdown":"https://miscsubjects.com/api/articles/system-map?format=markdown","not_medical_advice":true},"_explain":{"feature":"bundle","name":"LLM article bundle","what":"Paste-ready package: body + claims + sources + voxels + provenance + manifest + constitution.","why":"Every feature is auditable collective intelligence","how":"Paste into any LLM. Read §SELF first. Write back via ingest or claim endpoints in llm_manifest.","model":null,"verifies":null,"urls":{"read":"https://miscsubjects.com/api/articles/turing-1936/bundle?format=markdown"},"imessage":null,"router":null,"related":[{"id":"topology","what":"Claims, sources, anecdotes, user reports, related embeds, question graph slice — for ask/ROUTER."},{"id":"voxels","what":"Claims as atoms, sources as edges (supported_by, posted_by). Per-claim provenance."},{"id":"ask","what":"Answer only from topology; creates question_node with gaps and ingest_hint."},{"id":"ingest","what":"Parse pasted evidence → source ledger + claims + evidence_ingest node."},{"id":"claim_post","what":"Prompt-injection style POST — one claim voxel with who_claims + posted_by."},{"id":"llm_manifest","what":"Machine-readable read/write contract for external LLMs."}],"not_medical_advice":true},"bundle_version":1,"generated_at":"2026-07-04T22:32:18.189Z","slug":"turing-1936","title":"Turing 1936 — On Computable Numbers","url":"https://miscsubjects.com/a/turing-1936","register":"source","tags":["source","grain","convergence","turing"],"posted_at":"2026-07-04T19:34:40.559Z","updated_at":"2026-07-04T20:42:50.420Z","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","claims":[{"id":"claim-1","text":"Some problems cannot be solved by any mechanical procedure; the Entscheidungsproblem is undecidable.","tier":"system","weight":1,"effective_weight":1,"source_ids":["turing-1936"],"status":"active"},{"id":"claim-2","text":"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.","tier":"system","weight":1,"effective_weight":1,"source_ids":["turing-1936"],"status":"active"},{"id":"claim-3","text":"There exists a universal machine that can simulate any other Turing machine given its description and input.","tier":"system","weight":1,"effective_weight":1,"source_ids":["turing-1936"],"status":"active"},{"id":"claim-4","text":"No machine can predict whether another machine will halt or run forever (the halting problem).","tier":"system","weight":1,"effective_weight":1,"source_ids":["turing-1936"],"status":"active"},{"id":"claim-5","text":"The Entscheidungsproblem falls immediately from the undecidability of the halting problem.","tier":"system","weight":0.95,"effective_weight":0.95,"source_ids":["turing-1936"],"status":"active"},{"id":"claim-6","text":"Church, Post, and Turing arrived independently at the same limit using different methods (lambda calculus, finite combinatory processes, and Turing machines).","tier":"system","weight":0.9,"effective_weight":0.9,"source_ids":["turing-1936","church-1936","post-1936"],"status":"active"},{"id":"claim-7","text":"The Church-Turing thesis is a hypothesis about physics, not a theorem, and may fail at quantum or biological scales.","tier":"speculative","weight":0.7,"effective_weight":0.7,"source_ids":["turing-1936"],"status":"active"}],"sources":[{"id":"church-1936","type":"adjacent","url":"","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.","quote":"","claim_ids":["claim-6"]},{"id":"post-1936","type":"adjacent","url":"","title":"Post's Finite Combinatory Processes (1936)","summary":"Emil Post arrived independently with finite combinatory processes, a third path to the same limit.","quote":"","claim_ids":["claim-6"]},{"id":"turing-1936","type":"primary","url":"https://doi.org/10.1112/plms/s2-42.1.230","title":"On Computable Numbers, with an Application to the Entscheidungsproblem","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"]},{"id":"godel-1931","type":"adjacent","url":"","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.","quote":"","claim_ids":["claim-1"]}],"voxels":{"slug":"turing-1936","counts":{"voxels":7,"sources":4,"edges":9},"note":"slim bundle — full voxels at /api/articles/turing-1936/voxels"},"constitution":{"url":"https://miscsubjects.com/api/articles/constitution"},"provenance":[],"contributions":[],"topology":null,"slim":true,"ledger_totals":{"claims":7,"sources":4,"exported_claims":7,"exported_sources":4},"question_graph":{"slug":"turing-1936","questions":[],"evidence":[],"edges":[],"counts":{"questions":0,"evidence":0,"edges":0}},"verification":{"provenance":{"valid":true,"entries":0,"head":"genesis"},"sources":{"valid":false,"broken_at":0}},"counts":{"claims":7,"sources":4,"provenance":0,"contributions":0,"questions":0,"evidence_ingests":0,"voxel_edges":9},"llm_manifest":{"version":"1","site":"https://miscsubjects.com","purpose":"Peptide evidence articles with hash-chained source ledgers, tiered claims, and a question graph. LLMs should READ bundles/URLs and WRITE back via ingest — never invent doses.","read":{"human_page":"https://miscsubjects.com/a/turing-1936","bundle_json":"https://miscsubjects.com/api/articles/turing-1936/bundle","bundle_markdown":"https://miscsubjects.com/api/articles/turing-1936/bundle?format=markdown","topology":"https://miscsubjects.com/api/articles/turing-1936/topology","question_graph":"https://miscsubjects.com/api/articles/turing-1936/question-graph","sources":"https://miscsubjects.com/api/articles/turing-1936/sources","provenance":"https://miscsubjects.com/api/articles/turing-1936/provenance","contributions":"https://miscsubjects.com/api/articles/turing-1936/contributions","graph_topology":"https://miscsubjects.com/api/articles/turing-1936/graph-topology?question={question}","voxels":"https://miscsubjects.com/api/articles/turing-1936/voxels","constitution":"https://miscsubjects.com/api/articles/constitution","ontology":"https://miscsubjects.com/api/articles/ontology","system_map":"https://miscsubjects.com/api/articles/system-map","system_map_markdown":"https://miscsubjects.com/api/articles/system-map?format=markdown","health":"https://miscsubjects.com/api/articles/turing-1936/health","repair":"POST https://miscsubjects.com/api/protocol/repair","list_articles":"https://miscsubjects.com/api/articles","graph_canvas":"https://miscsubjects.com/graph.html?slugs=turing-1936","graph_yield":"https://miscsubjects.com/api/graph?slugs=turing-1936&layer=yield","obsidian_vault":"https://miscsubjects.com/api/articles/obsidian-vault?slugs=turing-1936","graph_query":"https://miscsubjects.com/api/v1/query?from=turing-1936&kind=claim&where=tier=human"},"ask":{"description":"Answer only from topology; creates a question_node with gaps.","api":"POST https://miscsubjects.com/api/protocol/ask","body":{"slug":"{slug}","question":"string"},"imessage":"turing-1936|your question","router_tag":"[ARTICLE_ASK]turing-1936|question[/ARTICLE_ASK]","auth":"x-terminal-key header for API; iMessage/WhatsApp via miscsubjects build"},"ingest":{"description":"Parse pasted evidence → source ledger + claims + evidence_ingest node.","api":"POST https://miscsubjects.com/api/protocol/ingest","body":{"slug":"{slug}","evidence":"paste text","question_node_id":"optional qn_..."},"imessage":"ingest turing-1936|q:{node_id}|paste evidence","router_tag":"[ARTICLE_INGEST]turing-1936|evidence[/ARTICLE_INGEST]","tiers":["human","preclinical","anecdotal","mechanistic","speculative"]},"claim":{"description":"Prompt-injection style POST — one claim voxel with who_claims + posted_by provenance.","api":"POST https://miscsubjects.com/api/protocol/claim","body":{"slug":"{slug}","text":"one assertion","tier":"human|preclinical|anecdotal|mechanistic|speculative","who_claims":"study author, platform, or model id","source_ids":"optional [s1]"},"imessage":"claim turing-1936|tier|assertion — who claims it?","router_tag":"[ARTICLE_CLAIM]turing-1936|tier|assertion[/ARTICLE_CLAIM]","slots":["what_it_is","who_claims_what","what_is_known","what_is_unknown","mechanism","limitations","disclaimer"]},"tiers":{"human":0.8,"preclinical":0.5,"anecdotal":0.3,"mechanistic":0.3,"speculative":0.1},"invariants":["Self-explaining — every API JSON has _self; every paste widget has §SELF; root index at /api/articles/system-map","Append-only — revisions preserved at ?rev=n","Source chain verifies integrity, not truth","Answers must cite claim ids and source ids from topology","Not medical advice"],"constitution":{"version":1,"principle":"Articles are voxel graphs of claims — not prose blobs. Every assertion is a claim atom with tier, weight, source_ids, and posted_by provenance.","slots":[{"id":"what_it_is","required":true,"answers":"What is this peptide/stack/condition?"},{"id":"who_claims_what","required":true,"answers":"Who claims what — study authors, platforms, n=?"},{"id":"what_is_known","required":true,"answers":"What is known with tier labels (human/preclinical/anecdotal)"},{"id":"what_is_unknown","required":true,"answers":"What is NOT known — explicit gaps"},{"id":"mechanism","required":false,"answers":"Proposed mechanism (mechanistic tier only)"},{"id":"limitations","required":true,"answers":"Limits of evidence — no dose advice"},{"id":"disclaimer","required":true,"answers":"Not medical advice"}],"claim_rules":["One claim = one falsifiable assertion. No compound claims.","Every claim must declare tier: human|preclinical|anecdotal|mechanistic|speculative|system.","system tier = architecture/design axioms (not biological mechanism). Use for protocol self-definition.","Sourced claims must cite source_ids from the hash-chained ledger.","Unsourced claims must set source_status: unsourced and why_material.","posted_by is mandatory on every new claim (model id, human, or channel).","No medical advice, no doses, no 'you should take'.","Bad information is retracted (status:retracted), never deleted — retraction event stays on ledger.","Adversary challenges link via challenges[] / challenged_by[] — target may be downweighted.","Leaked secrets are scrubbed to [REDACTED:secret-leak] with scrub_events tombstone — honest audit trail."],"source_rules":["Every source is a voxel edge: type, url, exact quote, summary, found_by, accessed_at.","Sources hash-chain — prev/hash on append.","Anecdotal sources must name platform (reddit|x|youtube|imessage|user_entry)."],"ontology_rules":["Peptide articles (bpc-157, tb-500) are tree roots.","Condition articles (bpc-157-glp1-gut-damage) branch from peptides.","Stack articles (wolverine-stack-glp1) compose peptides — never duplicate peptide mechanism prose.","If an article has no parent embeds and is not a root peptide → sprawl candidate.","Misstep = duplicate scope with another slug; merge or reparent via embeds."],"post_protocol":{"claim":"POST /api/protocol/claim","source":"POST /api/protocol/sources","ingest":"POST /api/protocol/ingest","webhook":"POST /api/articles/<slug>/webhook {kind:claim|source}","imessage_claim":"claim {slug}|{tier}|your assertion — who claims it, source?","imessage_ingest":"ingest {slug}|evidence paste"}},"this_article":{"slug":"turing-1936","url":"https://miscsubjects.com/a/turing-1936","bundle_url":"https://miscsubjects.com/api/articles/turing-1936/bundle?format=markdown"}},"api_urls":{"bundle":"https://miscsubjects.com/api/articles/turing-1936/bundle","bundle_markdown":"https://miscsubjects.com/api/articles/turing-1936/bundle?format=markdown","topology":"https://miscsubjects.com/api/articles/turing-1936/topology","voxels":"https://miscsubjects.com/api/articles/turing-1936/voxels","constitution":"https://miscsubjects.com/api/articles/constitution","ontology":"https://miscsubjects.com/api/articles/ontology","question_graph":"https://miscsubjects.com/api/articles/turing-1936/question-graph","ask":"https://miscsubjects.com/api/protocol/ask","ingest":"https://miscsubjects.com/api/protocol/ingest","claim":"https://miscsubjects.com/api/protocol/claim","system_map":"https://miscsubjects.com/api/articles/system-map","system_map_markdown":"https://miscsubjects.com/api/articles/system-map?format=markdown"}}