{"_self":{"principle":"Self-explaining payload — no external context required. This _self block describes what you are reading and where to look next.","widget":"article_voxels","feature":"voxels","name":"Voxel graph","what":"Claims as atoms, sources as edges (supported_by, posted_by). Per-claim provenance.","contains":"claim voxels + source edges","slug":"turing-1936","urls":{"read":"https://miscsubjects.com/api/articles/turing-1936/voxels","write":"https://miscsubjects.com/api/protocol/claim"},"how_to_use":"Claims as atoms, sources as edges (supported_by, posted_by). Per-claim provenance.","write":"https://miscsubjects.com/api/protocol/claim","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":"constitution","name":"Article constitution","what":"Binding rules: required article slots, claim/source rules, ontology anti-sprawl.","urls":{"read":"https://miscsubjects.com/api/articles/constitution","read_md":"https://miscsubjects.com/api/articles/constitution?format=markdown"}},{"id":"sources_ledger","name":"Source ledger","what":"Hash-chained cited sources; verify integrity at GET .../sources.","urls":{"read":"https://miscsubjects.com/api/articles/turing-1936/sources","write":"https://miscsubjects.com/api/protocol/sources"}},{"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"}}],"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":"voxels","name":"Voxel graph","what":"Claims as atoms, sources as edges (supported_by, posted_by). Per-claim provenance.","why":"Every feature is auditable collective intelligence","how":"Claims as atoms, sources as edges (supported_by, posted_by). Per-claim provenance.","model":null,"verifies":null,"urls":{"read":"https://miscsubjects.com/api/articles/turing-1936/voxels","write":"https://miscsubjects.com/api/protocol/claim"},"imessage":null,"router":null,"related":[{"id":"constitution","what":"Binding rules: required article slots, claim/source rules, ontology anti-sprawl."},{"id":"sources_ledger","what":"Hash-chained cited sources; verify integrity at GET .../sources."},{"id":"claim_post","what":"Prompt-injection style POST — one claim voxel with who_claims + posted_by."}],"not_medical_advice":true},"slug":"turing-1936","voxels":[{"id":"claim-1","text":"Some problems cannot be solved by any mechanical procedure; the Entscheidungsproblem is undecidable.","tier":"system","weight":1,"status":"active","source_ids":["turing-1936"],"posted_by":null,"who_claims":null,"edges":[{"type":"supported_by","target":"turing-1936","source_type":"primary","hash":null}]},{"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,"status":"active","source_ids":["turing-1936"],"posted_by":null,"who_claims":null,"edges":[{"type":"supported_by","target":"turing-1936","source_type":"primary","hash":null}]},{"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,"status":"active","source_ids":["turing-1936"],"posted_by":null,"who_claims":null,"edges":[{"type":"supported_by","target":"turing-1936","source_type":"primary","hash":null}]},{"id":"claim-4","text":"No machine can predict whether another machine will halt or run forever (the halting problem).","tier":"system","weight":1,"status":"active","source_ids":["turing-1936"],"posted_by":null,"who_claims":null,"edges":[{"type":"supported_by","target":"turing-1936","source_type":"primary","hash":null}]},{"id":"claim-5","text":"The Entscheidungsproblem falls immediately from the undecidability of the halting problem.","tier":"system","weight":0.95,"status":"active","source_ids":["turing-1936"],"posted_by":null,"who_claims":null,"edges":[{"type":"supported_by","target":"turing-1936","source_type":"primary","hash":null}]},{"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,"status":"active","source_ids":["turing-1936","church-1936","post-1936"],"posted_by":null,"who_claims":null,"edges":[{"type":"supported_by","target":"turing-1936","source_type":"primary","hash":null},{"type":"supported_by","target":"church-1936","source_type":"adjacent","hash":null},{"type":"supported_by","target":"post-1936","source_type":"adjacent","hash":null}]},{"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,"status":"active","source_ids":["turing-1936"],"posted_by":null,"who_claims":null,"edges":[{"type":"supported_by","target":"turing-1936","source_type":"primary","hash":null}]}],"sources":[{"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","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'.","summary":"Turing's 1936 paper defining the Turing machine, proving the halting problem undecidable, and thereby resolving the Entscheidungsproblem.","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)","quote":"","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"]},{"id":"church-1936","type":"adjacent","url":"","title":"Church's Proof via Lambda Calculus (1936)","quote":"","summary":"Alonzo Church proved the same undecidability independently using lambda calculus, establishing equivalence with Turing's result.","claim_ids":["claim-6"]},{"id":"post-1936","type":"adjacent","url":"","title":"Post's Finite Combinatory Processes (1936)","quote":"","summary":"Emil Post arrived independently with finite combinatory processes, a third path to the same limit.","claim_ids":["claim-6"]}],"edges":[{"from":"claim-1","type":"supported_by","target":"turing-1936","source_type":"primary","hash":null},{"from":"claim-2","type":"supported_by","target":"turing-1936","source_type":"primary","hash":null},{"from":"claim-3","type":"supported_by","target":"turing-1936","source_type":"primary","hash":null},{"from":"claim-4","type":"supported_by","target":"turing-1936","source_type":"primary","hash":null},{"from":"claim-5","type":"supported_by","target":"turing-1936","source_type":"primary","hash":null},{"from":"claim-6","type":"supported_by","target":"turing-1936","source_type":"primary","hash":null},{"from":"claim-6","type":"supported_by","target":"church-1936","source_type":"adjacent","hash":null},{"from":"claim-6","type":"supported_by","target":"post-1936","source_type":"adjacent","hash":null},{"from":"claim-7","type":"supported_by","target":"turing-1936","source_type":"primary","hash":null}],"counts":{"voxels":7,"sources":4,"edges":9},"constitution_url":"/api/articles/constitution","ontology_url":"/api/articles/ontology","system_map_url":"/api/articles/system-map","claim_post":"POST /api/protocol/claim"}