{"_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":"nogo-n03","urls":{"read":"https://miscsubjects.com/api/articles/nogo-n03/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/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":"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/nogo-n03/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/nogo-n03/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/nogo-n03/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":"nogo-n03","voxels":[{"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,"status":"active","source_ids":["s1"],"posted_by":null,"who_claims":null,"edges":[{"type":"supported_by","target":"s1","source_type":"primary","hash":null}]},{"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,"status":"active","source_ids":["s2"],"posted_by":null,"who_claims":null,"edges":[{"type":"supported_by","target":"s2","source_type":"primary","hash":null}]},{"id":"c3","text":"Rice's theorem generalizes the halting problem: no non-trivial semantic property of programs is decidable.","tier":"system","weight":0.9,"status":"active","source_ids":["s3"],"posted_by":null,"who_claims":null,"edges":[{"type":"supported_by","target":"s3","source_type":"primary","hash":null}]},{"id":"c4","text":"The three results form a wall: self-knowledge is fundamentally bounded within any formal system.","tier":"system","weight":0.85,"status":"active","source_ids":["s1","s2","s3"],"posted_by":null,"who_claims":null,"edges":[{"type":"supported_by","target":"s1","source_type":"primary","hash":null},{"type":"supported_by","target":"s2","source_type":"primary","hash":null},{"type":"supported_by","target":"s3","source_type":"primary","hash":null}]},{"id":"c5","text":"These limits are not bugs; they are features of formal systems — they define what 'knowable' means.","tier":"system","weight":0.75,"status":"active","source_ids":[],"posted_by":null,"who_claims":null,"edges":[]},{"id":"c6","text":"The wall applies to any system that reasons about itself: minds, organizations, algorithms, universes.","tier":"speculative","weight":0.7,"status":"active","source_ids":[],"posted_by":null,"who_claims":null,"edges":[]},{"id":"c7","text":"The practical implication: any complex system must contain irreducible uncertainty about its own future states.","tier":"system","weight":0.8,"status":"active","source_ids":[],"posted_by":null,"who_claims":null,"edges":[]}],"sources":[{"id":"s1","type":"primary","url":"https://plato.stanford.edu/entries/goedel/","title":"Gödel 1931 — On Formally Undecidable Propositions","quote":"","summary":"Gödel proved that in any consistent formal system capable of arithmetic, there exist true statements that cannot be proven within the system.","claim_ids":["c1","c4"]},{"id":"s2","type":"primary","url":"https://plato.stanford.edu/entries/turing/","title":"Turing 1936 — On Computable Numbers","quote":"","summary":"Turing proved that no general algorithm can determine whether an arbitrary program halts, establishing fundamental limits on computation.","claim_ids":["c2","c4"]},{"id":"s3","type":"primary","url":"https://en.wikipedia.org/wiki/Rice%27s_theorem","title":"Rice's Theorem (1953)","quote":"","summary":"Rice's theorem states that all non-trivial semantic properties of programs are undecidable, generalizing the halting problem.","claim_ids":["c3","c4"]}],"edges":[{"from":"c1","type":"supported_by","target":"s1","source_type":"primary","hash":null},{"from":"c2","type":"supported_by","target":"s2","source_type":"primary","hash":null},{"from":"c3","type":"supported_by","target":"s3","source_type":"primary","hash":null},{"from":"c4","type":"supported_by","target":"s1","source_type":"primary","hash":null},{"from":"c4","type":"supported_by","target":"s2","source_type":"primary","hash":null},{"from":"c4","type":"supported_by","target":"s3","source_type":"primary","hash":null}],"counts":{"voxels":7,"sources":3,"edges":6},"constitution_url":"/api/articles/constitution","ontology_url":"/api/articles/ontology","system_map_url":"/api/articles/system-map","claim_post":"POST /api/protocol/claim"}