{"_self":{"principle":"Self-explaining payload — no external context required. This _self block describes what you are reading and where to look next.","widget":"article_topology","feature":"topology","name":"Article topology","what":"Claims, sources, anecdotes, user reports, related embeds, question graph slice — for ask/ROUTER.","contains":"claims, sources, anecdotes, question_graph slice","slug":"convergence-c20","urls":{"read":"https://miscsubjects.com/api/articles/convergence-c20/topology"},"how_to_use":"Claims, sources, anecdotes, user reports, related embeds, question graph slice — for ask/ROUTER.","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/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":"ask","name":"Ask protocol","what":"Answer only from topology; creates question_node with gaps and ingest_hint.","urls":{"read":"https://miscsubjects.com/api/articles/convergence-c20/prompts","write":"https://miscsubjects.com/api/protocol/ask"}},{"id":"graph_topology","name":"Cross-article graph","what":"Merged claims/sources across condition+stack slugs for one question.","urls":{"read":"https://miscsubjects.com/api/articles/convergence-c20/graph-topology?question=..."}},{"id":"question_graph","name":"Question graph","what":"Ask nodes (questions + gaps) and evidence_ingest nodes (pasted model output).","urls":{"read":"https://miscsubjects.com/api/articles/convergence-c20/question-graph","write":"https://miscsubjects.com/api/protocol/ask"}},{"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/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":"topology","name":"Article topology","what":"Claims, sources, anecdotes, user reports, related embeds, question graph slice — for ask/ROUTER.","why":"Every feature is auditable collective intelligence","how":"Claims, sources, anecdotes, user reports, related embeds, question graph slice — for ask/ROUTER.","model":null,"verifies":null,"urls":{"read":"https://miscsubjects.com/api/articles/convergence-c20/topology"},"imessage":null,"router":null,"related":[{"id":"ask","what":"Answer only from topology; creates question_node with gaps and ingest_hint."},{"id":"graph_topology","what":"Merged claims/sources across condition+stack slugs for one question."},{"id":"question_graph","what":"Ask nodes (questions + gaps) and evidence_ingest nodes (pasted model output)."},{"id":"voxels","what":"Claims as atoms, sources as edges (supported_by, posted_by). Per-claim provenance."}],"not_medical_advice":true},"slug":"convergence-c20","title":"UNIVERSAL COMPUTATION / TURING COMPLETENESS","register":"grain","tags":["convergence","grain","encyclopedia"],"updated_at":"2026-07-04T20:43:38.152Z","body_excerpt":"## The Claim\n\nOne machine can simulate any other. This is not a metaphor. It is a theorem. Turing proved it in 1936. [SOURCE:turing-1936|type:theoretical]\n\nA Turing machine reads a tape. It writes symbols. It moves left or right. It is stupidly simple. It can simulate any computer that has ever been built. Any computer that will ever be built. Any computer that can be built. The same machine runs your phone, the stock market, and the cosmic web. [SOURCE:turing-1936|type:theoretical]\n\nThis is universal computation. It is the deepest convergence in the catalogue. It connects mathematics, physics, biology, and society. Every domain that processes information converges on the same limit. [SOURCE:shannon-1948|type:theoretical]\n\n## Definitions\n\n**Universal Turing machine**: A machine that reads the description of any other machine and runs it. One engine. Infinite programs. [SOURCE:turing-1936|type:theoretical]\n\n**Computational equivalence**: Two systems compute the same function. They may use different physics. They reach the same output. [SOURCE:turing-1936|type:theoretical]\n\n**Church-Turing thesis**: Every physically computable function is computable by a Turing machine. No one has found a counterexample. [SOURCE:turing-1936|type:theoretical]\n\n**Physical computation**: The universe computes. Physical systems process information. The limit is not abstract. It is real. [SOURCE:landauer-1961|type:theoretical]\n\n**Dissipation-driven computation**: Order emerges from thermodynamic gradients. Computation runs on entropy. [SOURCE:prigogine-1977|type:theoretical]\n\n**Self-reproducing automaton**: A machine that reads its own blueprint and builds a copy. Von Neumann proved this is possible. [SOURCE:von-neumann-1966|type:theoretical]\n\n## The Logic\n\nYou start with a formal system. You write rules. You write axioms. You derive theorems. Gödel showed in 1931 that any such system powerful enough to express arithmetic is either incomplete or inconsistent. It cannot prove all true statements. It cannot even prove its own consistency. [SOURCE:godel-1931|type:theoretical]\n\nTuring took this further. He asked: can a machine decide whether any other machine halts? The answer is no. The halting problem is undecidable. No algorithm can solve it. This is not a limitation of current technology. It is a limitation of logic itself. [SOURCE:turing-1936|type:theoretical]\n\nShannon asked a different question. What is information? He showed that all information is bits. The same math governs telegraphs, genes, and neurons. Information has a unit. It has a rate. It has a limit. [SOURCE:shannon-1948|type:theoretical]\n\nVon Neumann asked: can a machine reproduce? He designed a cellular automaton with 29 states. It read its own tape. It built a copy. The copy built a copy. This was not biology. It was mathematics. But it predicted DNA before DNA was discovered. [SOURCE:von-neumann-1966|type:theoretical]\n\nLandauer asked: what does computation cost? He proved that erasing one bit of information requires at least kT ln 2 of energy. Computation is physical. Information is physical. You cannot compute for free. [SOURCE:landauer-1961|type:theoretical]\n\nPrigogine asked: where does order come from? He showed that open systems far from equilibrium spontaneously organize. Dissipative structures maintain themselves by exporting entropy. A hurricane is a dissipative structure. A cell is a dissipative structure. A city is a dissipative structure. [SOURCE:prigogine-1977|type:theoretical]\n\nSchrödinger connected this to life. He asked: what is life? He answered: life feeds on negative entropy. Living systems maintain order by consuming gradients. They compute themselves into existence. [SOURCE:schrodinger-1944|type:theoretical]\n\nEngland asked: why does life emerge so readily? He showed that matter driven by thermodynamic gradients spontaneously restructures to dissipate more energy. Dissipation drives adaptation. Adaptation drives replication. Replication drives life. [SOURCE:england","ranking":"safety-first (interaction_risk/limitations), then quote-gated effective_weight","claims":[{"id":"c1","text":"Turing's 1936 theorem proves that a single machine can simulate any other computable machine.","tier":"system","weight":1,"interaction_risk":false,"status":"active","source_ids":["turing-1936"],"retracted_at":null,"retraction_reason":null,"challenged_by":[],"effective_weight":1,"quote_gated":false},{"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,"interaction_risk":false,"status":"active","source_ids":["landauer-1961"],"retracted_at":null,"retraction_reason":null,"challenged_by":[],"effective_weight":0.95,"quote_gated":false},{"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,"interaction_risk":false,"status":"active","source_ids":["turing-1936"],"retracted_at":null,"retraction_reason":null,"challenged_by":[],"effective_weight":0.9,"quote_gated":false},{"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,"interaction_risk":false,"status":"active","source_ids":["prigogine-1977"],"retracted_at":null,"retraction_reason":null,"challenged_by":[],"effective_weight":0.9,"quote_gated":false},{"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,"interaction_risk":false,"status":"active","source_ids":["turing-1936","shannon-1948","landauer-1961","prigogine-1977"],"retracted_at":null,"retraction_reason":null,"challenged_by":[],"effective_weight":0.6,"quote_gated":false},{"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,"interaction_risk":false,"status":"active","source_ids":["turing-1936"],"retracted_at":null,"retraction_reason":null,"challenged_by":[],"effective_weight":0.6,"quote_gated":false},{"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,"interaction_risk":false,"status":"active","source_ids":["england-2013"],"retracted_at":null,"retraction_reason":null,"challenged_by":[],"effective_weight":0.5,"quote_gated":false},{"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,"interaction_risk":false,"status":"active","source_ids":["turing-1936"],"retracted_at":null,"retraction_reason":null,"challenged_by":[],"effective_weight":0.3,"quote_gated":false}],"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"]}],"anecdotal_sources":[],"scientific_sources":[],"user_reports":[],"related_articles":[],"question_graph":{"slug":"convergence-c20","questions":[],"evidence":[],"edges":[],"counts":{"questions":0,"evidence":0,"edges":0}},"honesty":{"active_claims":8,"retracted_claims":0,"cut_claims":0,"challenges":0,"scrub_events":0,"note":"Retracted/cut claims stay on ledger but are excluded from ask unless ?include_inactive=1"},"counts":{"claims":8,"claims_total":8,"sources":5,"anecdotal":0,"scientific":0,"user_reports":0,"questions":0,"evidence_ingests":0}}