{"_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":"convergence-c20","urls":{"read":"https://miscsubjects.com/api/articles/convergence-c20/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/convergence-c20/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/convergence-c20/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/convergence-c20/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/convergence-c20/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":"convergence-c20","voxels":[{"id":"c1","text":"Turing's 1936 theorem proves that a single machine can simulate any other computable machine.","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":"c2","text":"The Church-Turing thesis asserts that every physically computable function is computable by a Turing machine; no counterexample has been found.","tier":"system","weight":0.9,"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":"c3","text":"Landauer's principle establishes that erasing one bit of information requires at least kT ln 2 of energy, making computation fundamentally physical.","tier":"system","weight":0.95,"status":"active","source_ids":["landauer-1961"],"posted_by":null,"who_claims":null,"edges":[{"type":"supported_by","target":"landauer-1961","source_type":"primary","hash":null}]},{"id":"c4","text":"Prigogine demonstrated that open systems far from equilibrium spontaneously organize into dissipative structures that maintain order by exporting entropy.","tier":"system","weight":0.9,"status":"active","source_ids":["prigogine-1977"],"posted_by":null,"who_claims":null,"edges":[{"type":"supported_by","target":"prigogine-1977","source_type":"primary","hash":null}]},{"id":"c5","text":"The universe is a computational system: information is physical, computation has a thermodynamic cost, and order emerges from chaos.","tier":"speculative","weight":0.6,"status":"active","source_ids":["turing-1936","shannon-1948","landauer-1961","prigogine-1977"],"posted_by":null,"who_claims":null,"edges":[{"type":"supported_by","target":"turing-1936","source_type":"primary","hash":null},{"type":"supported_by","target":"shannon-1948","source_type":"primary","hash":null},{"type":"supported_by","target":"landauer-1961","source_type":"primary","hash":null},{"type":"supported_by","target":"prigogine-1977","source_type":"primary","hash":null}]},{"id":"c6","text":"England's theory (2013) predicts that matter driven by thermodynamic gradients spontaneously restructures to dissipate more energy, and that dissipation drives adaptation, replication, and life.","tier":"speculative","weight":0.5,"status":"active","source_ids":["england-2013"],"posted_by":null,"who_claims":null,"edges":[{"type":"supported_by","target":"england-2013","hash":null}]},{"id":"c7","text":"Quantum computers may violate the Church-Turing thesis in terms of computational speed, though they remain Turing-complete.","tier":"speculative","weight":0.6,"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":"c8","text":"Hypercomputation (oracles, infinite time Turing machines) could theoretically solve the halting problem, but none have been physically realized.","tier":"anecdotal","weight":0.3,"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://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"]},{"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":[]},{"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"]},{"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"]},{"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"]}],"edges":[{"from":"c1","type":"supported_by","target":"turing-1936","source_type":"primary","hash":null},{"from":"c2","type":"supported_by","target":"turing-1936","source_type":"primary","hash":null},{"from":"c3","type":"supported_by","target":"landauer-1961","source_type":"primary","hash":null},{"from":"c4","type":"supported_by","target":"prigogine-1977","source_type":"primary","hash":null},{"from":"c5","type":"supported_by","target":"turing-1936","source_type":"primary","hash":null},{"from":"c5","type":"supported_by","target":"shannon-1948","source_type":"primary","hash":null},{"from":"c5","type":"supported_by","target":"landauer-1961","source_type":"primary","hash":null},{"from":"c5","type":"supported_by","target":"prigogine-1977","source_type":"primary","hash":null},{"from":"c6","type":"supported_by","target":"england-2013","hash":null},{"from":"c7","type":"supported_by","target":"turing-1936","source_type":"primary","hash":null},{"from":"c8","type":"supported_by","target":"turing-1936","source_type":"primary","hash":null}],"counts":{"voxels":8,"sources":5,"edges":11},"constitution_url":"/api/articles/constitution","ontology_url":"/api/articles/ontology","system_map_url":"/api/articles/system-map","claim_post":"POST /api/protocol/claim"}