{"_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":"landauer-1961","urls":{"read":"https://miscsubjects.com/api/articles/landauer-1961/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/landauer-1961/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/landauer-1961/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/landauer-1961/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/landauer-1961/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/landauer-1961/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/landauer-1961/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":"landauer-1961","title":"Landauer 1961 — Irreversibility and Heat Generation in the Computing Process","register":"source","tags":["source","grain","convergence","landauer"],"updated_at":"2026-07-04T20:41:33.640Z","body_excerpt":"## The Source\n\nRolf Landauer. \"Irreversibility and Heat Generation in the Computing Process.\" *IBM Journal of Research and Development*, Vol. 5, No. 3, pp. 183–191, July 1961. DOI: [10.1147/rd.53.0183](https://doi.org/10.1147/rd.53.0183).\n\n## The Claim\n\nErasing one bit costs at least $k_B T \\ln(2)$ joules. Information is physical. The bridge from bits to joules is a one-way toll — you cannot forget without heating the room.\n\n## The Context\n\n1961. IBM Thomas J. Watson Research Center, Yorktown Heights, New York. The transistor age roars. Computers fill rooms and dissipate kilowatts. Von Neumann had claimed every elementary act of computation must cost energy. [SOURCE:neumann-1966|type:theoretical] Landauer asked the sharper question: *which* operations pay the tax?\n\nHis answer: only the irreversible ones. Erasure is the crime. Copying is free. Reversible computation avoids the cost entirely. [SOURCE:bennett-1973|type:theoretical]\n\nThe intellectual climate was a tug-of-war. Shannon had made information abstract and clean — bits floating in a mathematical vacuum. [SOURCE:shannon-1948|type:mathematical] Boltzmann had tied entropy to microstates — disorder as counting. [SOURCE:boltzmann-1877|type:mathematical] Szilard's demon haunted the halls — could a tiny intelligence extract work from heat without penalty? [SOURCE:szilard-1929|type:theoretical] Landauer closed the loophole. The demon must pay. Erasure is the bill.\n\n## The Evidence\n\nLandauer derived the bound from Liouville's theorem and the Second Law. Consider a single bit — two states, 0 or 1. To erase it means resetting to 0 *regardless* of input. The phase space halves. Entropy drops by $k \\ln(2)$. The Second Law demands that entropy appear elsewhere. That elsewhere is heat: $Q \\geq k_B T \\ln(2)$.\n\nAt room temperature this is ~$2.87 \\times 10^{-21}$ joules per bit. A modern CMOS transistor dissipates $10^4$ to $10^6$ times this limit. [SOURCE:conte-2019|type:empirical] The bound is not a practical ceiling. It is a physical law.\n\nIn 2012 Bérut et al. trapped a single 2-micrometer colloidal particle in a modulated double-well laser potential. They measured the heat dissipated during bit erasure. The mean dissipated heat saturated at the Landauer limit in the quasi-static regime. [SOURCE:berut-2012|type:empirical] The principle holds. Yan et al. extended confirmation to the quantum regime with a single trapped $^{40}\\text{Ca}^+$ ion in 2018. [SOURCE:yan-2018|type:empirical]\n\n## The Convergence\n\nLandauer instantiates **C06 — Order is Compressibility; Information is Physical**. [SOURCE:grain-c06|type:philosophical]\n\nFour fields. Four nations. Four decades. One quantity.\n\nShannon at Bell Labs (1948) measured information by compressibility — how many bits to transmit a message. [SOURCE:shannon-1948|type:mathematical] Boltzmann in Vienna (1870s) counted gas microstates. [SOURCE:boltzmann-1877|type:mathematical] Kolmogorov in Moscow (1965) defined complexity as the shortest program that generates a string. [SOURCE:kolmogorov-1965|type:mathematical] Landauer at IBM (1961) proved erasure costs heat.\n\nIndependently derived. Unrelated methods. Same result: information and entropy are the same thing wearing different hats.\n\nLandauer also bridges to **C08 — Recursion / Self-Reference**. [SOURCE:grain-c08|type:philosophical] A system's description of itself is not external. It is a physical process with physical costs. DNA is a self-describing molecule. [SOURCE:watson-crick-1953|type:empirical] It pays the Landauer cost every time it replicates — error correction, proofreading, repair enzymes. Memory is not abstract. The substrate pays. [SOURCE:grain-p7|type:philosophical]\n\n## The Honest Limits\n\nLandauer only bound *irreversibly erased* information. Bennett showed reversible computation can avoid the cost entirely — run backward, no heat. [SOURCE:bennett-1973|type:theoretical] The bound is about forgetting, not computing.\n\nThe principle assumes thermal equilibrium. Non-equilibrium reservoi","ranking":"safety-first (interaction_risk/limitations), then quote-gated effective_weight","claims":[{"id":"c1","text":"Erasing one bit of information in thermal equilibrium dissipates at least k_B T ln(2) joules of heat.","tier":"system","weight":1,"interaction_risk":false,"status":"active","source_ids":["landauer-1961"],"retracted_at":null,"retraction_reason":null,"challenged_by":[],"effective_weight":1,"quote_gated":false},{"id":"c2","text":"Only irreversible operations pay the energy tax; copying and reversible computation can avoid the cost entirely.","tier":"system","weight":0.95,"interaction_risk":false,"status":"active","source_ids":["landauer-1961","bennett-1973"],"retracted_at":null,"retraction_reason":null,"challenged_by":[],"effective_weight":0.95,"quote_gated":false},{"id":"c3","text":"Information is physical — the bridge from bits to joules is a one-way toll; you cannot forget without heating the room.","tier":"system","weight":0.9,"interaction_risk":false,"status":"active","source_ids":["landauer-1961"],"retracted_at":null,"retraction_reason":null,"challenged_by":[],"effective_weight":0.9,"quote_gated":false},{"id":"c4","text":"Maxwell's demon must pay the erasure cost; the demon cannot extract work from heat without eventually erasing information and paying the Landauer toll.","tier":"system","weight":0.85,"interaction_risk":false,"status":"active","source_ids":["landauer-1961","szilard-1929"],"retracted_at":null,"retraction_reason":null,"challenged_by":[],"effective_weight":0.85,"quote_gated":false},{"id":"c5","text":"The Landauer bound assumes thermal equilibrium; non-equilibrium reservoirs can achieve information erasure below kT ln(2).","tier":"system","weight":0.8,"interaction_risk":false,"status":"active","source_ids":["konopik-2020"],"retracted_at":null,"retraction_reason":null,"challenged_by":[],"effective_weight":0.8,"quote_gated":false},{"id":"c6","text":"If Maxwell's demon is already governed by the Second Law, Landauer's principle is redundant; if not, it is insufficient.","tier":"speculative","weight":0.7,"interaction_risk":false,"status":"active","source_ids":["earman-norton-1999"],"retracted_at":null,"retraction_reason":null,"challenged_by":[],"effective_weight":0.7,"quote_gated":false},{"id":"c7","text":"Four independently derived methods (Shannon, Boltzmann, Kolmogorov, Landauer) converge on the same result: information and entropy are the same thing wearing different hats.","tier":"speculative","weight":0.6,"interaction_risk":false,"status":"active","source_ids":["shannon-1948","boltzmann-1877","kolmogorov-1965","landauer-1961"],"retracted_at":null,"retraction_reason":null,"challenged_by":[],"effective_weight":0.6,"quote_gated":false}],"sources":[{"id":"landauer-1961","type":"primary","url":"https://doi.org/10.1147/rd.53.0183","title":"Irreversibility and Heat Generation in the Computing Process","quote":"Information is physical.","summary":"The original 1961 IBM paper deriving the minimum heat dissipation bound for irreversible bit erasure from Liouville's theorem and the Second Law of Thermodynamics.","claim_ids":["c1","c2","c3","c4"]},{"id":"bennett-1973","type":"adjacent","url":"https://miscsubjects.com/article/bennett-1973","title":"Bennett 1973 — Logical Reversibility of Computation","quote":"","summary":"Shows that reversible computation can avoid the Landauer cost entirely by running backward with no heat dissipation.","claim_ids":["c2"]},{"id":"berut-2012","type":"adjacent","url":"https://doi.org/10.1038/nature10872","title":"Experimental verification of Landauer's principle linking information and thermodynamics","quote":"","summary":"Bérut et al. (2012) trapped a colloidal particle in a double-well laser potential and measured heat dissipation during bit erasure, showing saturation at the Landauer limit in the quasi-static regime.","claim_ids":["c1"]},{"id":"konopik-2020","type":"rival","url":"","title":"Konopik et al. 2020 — Non-equilibrium information erasure below kT ln(2)","quote":"","summary":"Demonstrated that non-equilibrium reservoirs can enable information erasure below the Landauer limit, showing the bound is not universal but a thermal-equilibrium theorem.","claim_ids":["c5"]},{"id":"earman-norton-1999","type":"rival","url":"","title":"Earman & Norton 1999 — Exorcist XIV: The Wrath of Maxwell's Demon","quote":"","summary":"Philosophical challenge arguing Landauer's principle is either redundant (if the demon is already governed by the Second Law) or insufficient (if not). Bennett conceded this was 'the objection of greatest merit.'","claim_ids":["c6"]}],"anecdotal_sources":[],"scientific_sources":[],"user_reports":[],"related_articles":[],"question_graph":{"slug":"landauer-1961","questions":[],"evidence":[],"edges":[],"counts":{"questions":0,"evidence":0,"edges":0}},"honesty":{"active_claims":7,"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":7,"claims_total":7,"sources":5,"anecdotal":0,"scientific":0,"user_reports":0,"questions":0,"evidence_ingests":0}}