{"_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":"nogo-n03","urls":{"read":"https://miscsubjects.com/api/articles/nogo-n03/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/nogo-n03/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/nogo-n03/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/nogo-n03/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/nogo-n03/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/nogo-n03/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/nogo-n03/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:33:05.145Z","slug":"nogo-n03","title":"N03 — Gödel, Turing, Rice: The Wall of Self-Knowledge","url":"https://miscsubjects.com/a/nogo-n03","register":"grain","tags":["nogo","grain","encyclopedia","limits"],"posted_at":"2026-07-04T18:56:52.632Z","updated_at":"2026-07-04T22:25:04.938Z","body":"## The Claim\n\nEvery system powerful enough to reason contains truths it cannot see. You cannot build a mind that fully understands itself. The universe charges a tax on self-awareness — and the tax is permanent.\n\n## Definitions\n\n**Gödel Statement:** A sentence that says \"I am unprovable\" — and means it.\n\n**Incompleteness:** True things exist that your rules cannot reach.\n\n**Halting Problem:** No program can predict if every other program stops.\n\n**Rice's Property:** Any interesting question about what a program *does* has no general answer.\n\n**Formal System:** A set of rules precise enough for a machine to follow.\n\n**Self-Reference:** A system pointing back at itself — like a mirror in a mirror.\n\n## The Logic\n\nYou build a logical machine. You teach it arithmetic. It works. It proves theorems.\n\nThen Gödel shows you the crack. He constructs a sentence that says: \"I am not provable in this system.\" If the system proves it, the system lies. If the system cannot prove it, the sentence is true — and the system is incomplete.\n\nYou cannot fix this. You cannot add the missing sentence as a new rule. Gödel will find another crack. The crack is structural. It is the price of power.\n\nTuring makes it concrete. You write a program that checks other programs. You ask: does this program halt? You run your checker. It spins forever on some inputs. You patch it. You add timeouts. You add heuristics. You think you win.\n\nTuring proves you lose. No patch works for every program. No timeout covers every case. The question itself is undecidable.\n\nRice generalizes the blow. You want to know if a program computes the right answer? No. You want to know if it is malicious? No. You want to know if it ever outputs zero? No. Any interesting property of what a program *does* is undecidable.\n\nThe three theorems strike the same nerve. They say: complexity breeds blindness. The more a system can do, the more it cannot know about itself.\n\nThis is not a bug. It is the architecture. A universe that allows self-reference must also allow self-deception. A universe that allows computation must also allow endless loops. The limit is not optional. It is structural.\n\nYou live inside this limit. Your brain is a formal system. It runs programs. It cannot fully know its own halting. It cannot fully prove its own consistency. It cannot fully inspect its own properties.\n\nThis is why therapy takes years. This is why you surprise yourself. This is why institutions audit themselves and still fail. The system looking at itself cannot see the whole picture. The mirror has a blind spot.\n\n## The Evidence\n\n**Kurt Gödel, Vienna, 1931.** He writes twenty-five pages. He destroys Hilbert's program. He proves that any arithmetic powerful enough to count contains a ghost it cannot exorcise. The paper sits in *Monatshefte für Mathematik und Physik*. Nobody understands it for years. Then they do. Mathematics changes forever.\n\n**Alan Turing, Cambridge, 1936.** He is twenty-four. He writes \"On Computable Numbers.\" He invents the computer to prove what computers cannot do. The Nazis later force him to crack Enigma. He saves millions. Britain prosecutes him for homosexuality. He eats a poisoned apple. The theorems outlive the persecution.\n\n**Henry Rice, 1953.** He proves the generalization. Every interesting question about programs is undecidable. The paper appears in *Transactions of the American Mathematical Society*. It kills an entire field of wishful thinking. Program verification becomes engineering, not magic.\n\n**The Roman Empire, 476 CE.** Rome builds a system of self-knowledge — census, law, bureaucracy, audit. It grows too complex to audit itself. It cannot determine which provinces will halt in loyalty and which will loop in revolt. It collapses. The halting problem wins again.\n\n**Charles Ponzi, Boston, 1920.** He builds a program that pays old investors with new money. The system computes wealth for a while. Nobody can determine, from inside the system, whether it halts or runs forever. It runs until it doesn't. The property \"this is a fraud\" was undecidable to the investors. Rice's theorem on Wall Street.\n\n**A forest fire, 2023.** Fire suppression creates fuel loading. The system (forest + policy) grows complex. Managers cannot determine whether the next season halts in control or loops into megafire. The property \"this will burn catastrophically\" is undecidable in the current model. Paradise, California learns this. The theorem scales to ecology.\n\n**Your immune system.** It patrols for tumors. It asks: is this cell a self or a non-self? The question is a Rice property — non-trivial, semantic, undecidable in the general case. Sometimes it answers wrong. Autoimmune disease. Cancer. The system cannot fully inspect itself. The limit is biological.\n\n## The Falsifier\n\nBuild a formal system that proves all truths about itself and never lies. That kills Gödel. Write a program that predicts halting for every possible program-input pair. That kills Turing. Design an algorithm that decides any interesting semantic property of any program. That kills Rice. None of these exist. If you find one, you break the grain. You do not get a prize. You get a contradiction.\n\n## The Uncertainty\n\nWe do not know if human cognition is a formal system. If your mind is not formal, Gödel may not apply. You might have an escape hatch. But no one knows what a non-formal mind looks like. Neuroscience has not found it. Philosophy has not defined it. The question is open.\n\nWe do not know if probabilistic methods bypass the limit. You can guess halting with high accuracy. You can predict tumor malignancy with 99% confidence. But exact decidability remains impossible. The boundary between \"good enough\" and \"provable\" is murky. Engineering thrives there. Mathematics is silent.\n\nWe do not know if the universe itself is a formal system. If physical reality is computable, the limits apply to reality. If reality is not computable, something stranger operates. Quantum mechanics whispers at this boundary. No one has settled it.\n\nThe rival frame is optimism. Technologists believe that better algorithms will eat the undecidable. They believe that approximation erases the limit. This is false in theory. It is sometimes true in practice. The tension between theory and practice is the frontier.\n\nAnother rival: mysticism. The apophatic tradition says you cannot know God. The theorems say you cannot fully know anything complex. Are these the same limit? We do not know. The mystics arrived first. The mathematicians proved it. The connection is suggestive, not proven.\n\nThe honest limit is this. We know the wall exists. We know its exact shape. We do not know what lies on the other side. We cannot look. The wall is the mirror.","claims":[{"id":"c1","text":"Gödel's incompleteness theorems (1931) prove that any sufficiently powerful formal system cannot be both consistent and complete.","tier":"system","weight":0.95,"effective_weight":0.95,"source_ids":["s1"],"status":"active"},{"id":"c2","text":"Turing's halting problem (1936) proves that no general algorithm can determine whether an arbitrary program will halt or run forever.","tier":"system","weight":0.95,"effective_weight":0.95,"source_ids":["s2"],"status":"active"},{"id":"c3","text":"Rice's theorem generalizes the halting problem: no non-trivial semantic property of programs is decidable.","tier":"system","weight":0.9,"effective_weight":0.9,"source_ids":["s3"],"status":"active"},{"id":"c4","text":"The three results form a wall: self-knowledge is fundamentally bounded within any formal system.","tier":"system","weight":0.85,"effective_weight":0.85,"source_ids":["s1","s2","s3"],"status":"active"},{"id":"c7","text":"The practical implication: any complex system must contain irreducible uncertainty about its own future states.","tier":"system","weight":0.8,"effective_weight":0.8,"source_ids":[],"status":"active"},{"id":"c5","text":"These limits are not bugs; they are features of formal systems — they define what 'knowable' means.","tier":"system","weight":0.75,"effective_weight":0.75,"source_ids":[],"status":"active"},{"id":"c6","text":"The wall applies to any system that reasons about itself: minds, organizations, algorithms, universes.","tier":"speculative","weight":0.7,"effective_weight":0.7,"source_ids":[],"status":"active"}],"sources":[{"id":"s1","type":"primary","url":"https://plato.stanford.edu/entries/goedel/","title":"Gödel 1931 — On Formally Undecidable Propositions","summary":"Gödel proved that in any consistent formal system capable of arithmetic, there exist true statements that cannot be proven within the system.","quote":"","claim_ids":["c1","c4"]},{"id":"s2","type":"primary","url":"https://plato.stanford.edu/entries/turing/","title":"Turing 1936 — On Computable Numbers","summary":"Turing proved that no general algorithm can determine whether an arbitrary program halts, establishing fundamental limits on computation.","quote":"","claim_ids":["c2","c4"]},{"id":"s3","type":"primary","url":"https://en.wikipedia.org/wiki/Rice%27s_theorem","title":"Rice's Theorem (1953)","summary":"Rice's theorem states that all non-trivial semantic properties of programs are undecidable, generalizing the halting problem.","quote":"","claim_ids":["c3","c4"]}],"voxels":{"slug":"nogo-n03","counts":{"voxels":7,"sources":3,"edges":6},"note":"slim bundle — full voxels at /api/articles/nogo-n03/voxels"},"constitution":{"url":"https://miscsubjects.com/api/articles/constitution"},"provenance":[],"contributions":[],"topology":null,"slim":true,"ledger_totals":{"claims":7,"sources":3,"exported_claims":7,"exported_sources":3},"question_graph":{"slug":"nogo-n03","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":3,"provenance":0,"contributions":0,"questions":0,"evidence_ingests":0,"voxel_edges":6},"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/nogo-n03","bundle_json":"https://miscsubjects.com/api/articles/nogo-n03/bundle","bundle_markdown":"https://miscsubjects.com/api/articles/nogo-n03/bundle?format=markdown","topology":"https://miscsubjects.com/api/articles/nogo-n03/topology","question_graph":"https://miscsubjects.com/api/articles/nogo-n03/question-graph","sources":"https://miscsubjects.com/api/articles/nogo-n03/sources","provenance":"https://miscsubjects.com/api/articles/nogo-n03/provenance","contributions":"https://miscsubjects.com/api/articles/nogo-n03/contributions","graph_topology":"https://miscsubjects.com/api/articles/nogo-n03/graph-topology?question={question}","voxels":"https://miscsubjects.com/api/articles/nogo-n03/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/nogo-n03/health","repair":"POST https://miscsubjects.com/api/protocol/repair","list_articles":"https://miscsubjects.com/api/articles","graph_canvas":"https://miscsubjects.com/graph.html?slugs=nogo-n03","graph_yield":"https://miscsubjects.com/api/graph?slugs=nogo-n03&layer=yield","obsidian_vault":"https://miscsubjects.com/api/articles/obsidian-vault?slugs=nogo-n03","graph_query":"https://miscsubjects.com/api/v1/query?from=nogo-n03&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":"nogo-n03|your question","router_tag":"[ARTICLE_ASK]nogo-n03|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 nogo-n03|q:{node_id}|paste evidence","router_tag":"[ARTICLE_INGEST]nogo-n03|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 nogo-n03|tier|assertion — who claims it?","router_tag":"[ARTICLE_CLAIM]nogo-n03|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":"nogo-n03","url":"https://miscsubjects.com/a/nogo-n03","bundle_url":"https://miscsubjects.com/api/articles/nogo-n03/bundle?format=markdown"}},"api_urls":{"bundle":"https://miscsubjects.com/api/articles/nogo-n03/bundle","bundle_markdown":"https://miscsubjects.com/api/articles/nogo-n03/bundle?format=markdown","topology":"https://miscsubjects.com/api/articles/nogo-n03/topology","voxels":"https://miscsubjects.com/api/articles/nogo-n03/voxels","constitution":"https://miscsubjects.com/api/articles/constitution","ontology":"https://miscsubjects.com/api/articles/ontology","question_graph":"https://miscsubjects.com/api/articles/nogo-n03/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"}}