A Joke That Became a Crisis
When Claude Shannon was deciding what to call his new measure of uncertainty, John von Neumann gave him a piece of advice: "Call it entropy. Nobody understands entropy, so in a debate you will always have the advantage."
It was a brilliant joke. And it created seventy years of confusion. The naming collision between Shannon's information entropy and Boltzmann-Clausius thermodynamic entropy has produced a genuine scientific crisis — one that reaches into computer science, physics, and the very foundations of how we think about computation.
The Confusion
For decades, computer science has operated on a deeply held assumption: that information entropy (Shannon) and thermal entropy (Boltzmann/Clausius) are intimately related. The supposed bridge between them is Landauer's principle — the claim that erasing one bit of information must dissipate at least kT ln(2) joules of energy as heat, where k is Boltzmann's constant and T is the temperature of the environment.
Since Rolf Landauer proposed this in 1961, it has been treated as physical law. Entire research programs — reversible computing, quantum thermodynamics of information, Maxwell's demon resolutions — were built on this assumption. Textbooks teach it. Papers cite it. Conferences take it for granted. Careers depend on it.
But what if the two entropies are not the same quantity at all? What if the entire bridge is an illusion?
The Refutation: Kish and Ferry (2018)
In 2018, Laszlo B. Kish and David K. Ferry published a rigorous analysis that proved — with mathematical precision — that information entropy and thermal entropy are fundamentally different quantities. "Apples and oranges" that cannot be equated. Here is what they found:
1. Thermal entropy is objective. It is a property of the physical system itself. It does not depend on who is measuring it or what instrument is used. A gas at temperature T in volume V has a definite thermodynamic entropy regardless of the observer. It is a fact about the universe.
2. Information entropy is subjective. It depends on the measurement instrument, the observer's knowledge, and the chosen encoding. The same physical system can have completely different information entropies depending on how you measure it and what you already know. It is a fact about the observer.
3. They can be separated in space and time. The information about a system and the system's thermodynamic state can exist in completely different locations at completely different times. This single fact makes any general equivalence mathematically outside the declared model.
4. Information entropy can violate the Third Law of Thermodynamics. At absolute zero, thermodynamic entropy reaches a minimum. Information entropy has no such constraint — it can take any value regardless of temperature. They do not even obey the same laws.
Reference: L.B. Kish and D.K. Ferry, "Information entropy and thermal entropy: apples and oranges," J. Comput. Electron. 17, 43-50 (2018).
Zero-Energy Erasure
But it gets even more devastating. Even before the 2018 paper, Kish and collaborators had already struck at the heart of Landauer's principle. In 2016, they demonstrated something remarkable: information erasure can occur with zero or even negative energy dissipation through thermalization in double-potential-well memories.
The mechanism is elegant: a memory element with two potential wells (representing 0 and 1) can be erased by allowing the system to thermalize — to reach thermal equilibrium with its environment. This process does not require the minimum kT ln(2) energy dissipation that Landauer predicted. In certain configurations, it can even release energy. Let me say that again: erasing a bit can give you energy back.
This means Landauer's erasure bound is not an approximation that future technology might approach. It is fundamentally wrong as a universal physical law. The emperor has no clothes.
Reference: L.B. Kish, C.G. Granqvist, S.P. Khatri, and F. Peper, "Zero and negative energy dissipation at information-theoretic erasure," J. Comput. Electron. 15, 335-339 (2016).
The Key Insight for Software
Now here is where this physics debate becomes directly relevant to what we build. Kish's 2016 paper contains a remarkable result (Equations 11-12): in a deterministic computer with error-free memory, the information entropy is always zero.
Stop and think about what this means. A deterministic program that takes input X and always produces output Y has zero informational uncertainty. No randomness. No ambiguity. No missing information. The Shannon entropy of its output, given its input, is exactly zero. That is not a metaphor. That is a mathematical fact.
This is precisely what Phi C = 1 means in Digital Circuitality. A formally verified, deterministic system — one where every input maps to exactly one output through a verified transformation — has zero informational uncertainty. When the Circuitality Coefficient reaches unity, the system's information entropy reaches zero. These two conditions are mathematically equivalent. And that equivalence is the foundation of everything we build.
What This Changes for Digital Circuitality
Our framework originally referenced Landauer's principle as part of its thermodynamic analogy. Thanks to Prof. Kish's direct guidance, we corrected this. And here is the thing that surprised us: the correction made the framework stronger, not weaker.
The framework is now purely information-theoretic. Our verification metrics no longer rely on any contested relationship between information and physical energy. They measure one thing: informational uncertainty. Pure Shannon entropy. No thermodynamic claims. No physics debates. Just math.
Phi C = 1 means zero informational uncertainty. When the Circuitality Coefficient reaches unity, the system has zero information entropy. Not zero physical energy. Not zero heat dissipation. Zero uncertainty about what the system will do. This is a statement about knowledge and determinism — the purest kind of engineering guarantee.
No dependency on contested physics. By removing the Landauer connection, Digital Circuitality no longer depends on any disputed physical claim. The framework stands on pure information theory — Shannon (1948), established and uncontroversial for nearly 80 years — plus formal verification, which is pure mathematics.
A theory that depends on fewer assumptions is more robust than one that depends on more. We removed an assumption, and the whole structure got stronger. That is how you know the correction was right.
Brillouin's Negentropy
The correct historical inspiration is Leon Brillouin (1953), who proposed that information is negentropy — the negative of entropy. Gaining information about a system reduces your uncertainty, which is analogous to reducing entropy. It is a beautiful idea, and it motivated much of Digital Circuitality's early development.
But we are honest about the limitations. Even Brillouin's negentropy principle is not a general law. Kish and Ferry (2018) show that the relationship between information and thermodynamic entropy is more nuanced than a simple negation. There are cases where gaining information does not correspond to any thermodynamic change, and cases where thermodynamic changes carry no informational content.
So Digital Circuitality takes the safest possible path: pure Shannon information theory, with physical analogies used as metaphor and intuition, never as foundation. We say that a verified system "behaves like" a low-entropy physical system because it is deterministic and predictable. We do not claim that verification literally reduces thermodynamic entropy or saves physical energy. We are very precise about this distinction.
The metaphor is powerful. The physics would be wrong. We chose the math.
Seventy Years of Confusion, Resolved
Von Neumann's joke has had a long run. For seventy years, the conflation of information entropy and thermal entropy has muddied the waters in physics, computer science, and everything in between. Researchers built careers on the assumption that erasing a bit costs energy, that Maxwell's demon is defeated by Landauer's principle, that computation has irreducible thermodynamic limits. Entire fields were built on a naming collision.
Kish and Ferry resolved this confusion with mathematical rigor. The two entropies are different quantities with different properties, different domains, and different physical meanings. They share a name and a functional form — and absolutely nothing else.
Digital Circuitality builds on this resolution. By grounding our framework in pure information theory — where it belongs — we inherit the mathematical certainty of Shannon's work without the baggage of contested thermodynamic claims. The result is a framework that is cleaner, more honest, and built to last.
Sometimes the strongest move in science is admitting what you got wrong and building something better on the correction. That is exactly what we did.
Published by the BRIK64 team. For more on Digital Circuitality, see What Is Digital Circuitality?, EVA Algebra Deep Dive, and Precision as Domain.
