STRATA
Skip to study
XLVII

SOURCE RECORD / 2003

Reversibility and the record

DocumentedR01 · 2026-11-18
Scope of this record

KNOWN refers to the argument summarized in this theoretical source. It is not a claim of a cost-free, infinitely fast physical machine.

Statement

Bennett relates logically irreversible information manipulation to entropy increase in other physical degrees of freedom, while distinguishing reversible computation. [source]

Equation

Unrecorded

The connection is scoped to this source. No broader cross-domain equality is established by this entry.

Observation

The abstract highlights erasure and the merging of computational paths as logically irreversible operations. It locates the associated entropy increase outside the information-bearing description. [source]

Progressive questions

Which information is discarded by a chosen operation? Could the input be reconstructed from the output plus retained history? What resources are needed to preserve, reset or reuse that history?

Source response

The source argues for separating logical irreversibility from a broad claim that every computational operation incurs the same fundamental dissipation. [source]

Interpretation

XLVII proposal: show the forward mapping and retained record side by side. Reversing a displayed animation is not equivalent to demonstrating physical reversibility; the state bookkeeping and physical implementation must be specified.

Conclusion

The source supplies a distinction that constrains how the erasure experiment should be interpreted. [source]

Next experiment

Proposed: compare a reversible Boolean mapping with an irreversible reset on a small enumerated state space. Record which inputs become indistinguishable. This logical exercise can validate bookkeeping, but an energy claim would still require a separately specified physical model or measurement.

Work through a related example.

I.06 / Shannon information and communication

Calculate uncertainty for two binary sources.

A fair binary source has entropy of one bit per symbol. If one outcome occurs with probability 0.9 and the other with 0.1, the binary entropy is about 0.469 bits. Generate short illustrative sequences with these settings, compare their symbol counts, and examine why a short sample may differ noticeably from the generating probabilities.

VII.15 / Quantum thermodynamics

Compare populations with coherence.

Consider two two-level states with identical energy populations, one with off-diagonal coherence in the energy basis and one without it. Their energy averages can agree while their permitted transformations differ under specified operations. Draw the preparation, bath interaction, control field, and readout so that any work or coherence resource is included in the accounting.

X.09 / Formal logic, proof, verification, and scientific software

Separate a theorem from a test case.

Consider the claim that a function preserves a nonnegative quantity for every allowed input. A test suite can inspect selected inputs, while a proof must use the function definition and assumptions to cover the stated domain. Then ask whether the implemented numeric representation introduces rounding or overflow absent from the formal statement.

Follow earlier and later work.

Before

No linked record.

After

  • Proposed connection · UNKNOWNErasure has conditions

    Editorial research connection to investigate; not a verified correspondence, causal lineage, or mathematical equivalence.

Follow the chain
  1. Erasure has conditions · 1 link away · UNKNOWN
  2. Information is not meaning · 2 links away · UNKNOWN
  3. Memory as a collective state · 3 links away · UNKNOWN
  4. Compression → classification · 3 links away · UNKNOWN
  5. Prediction and residual error · 4 links away · UNKNOWN
  6. Dynamic Markov modelling · 4 links away · KNOWN
  7. Compression, reopened · 4 links away · UNKNOWN
  8. Attention without recurrence · 5 links away · UNKNOWN
  9. The chemical compass · 5 links away · UNKNOWN
  10. What survives a replication? · 5 links away · UNKNOWN
  11. Compute has a budget · 6 links away · UNKNOWN

Placement.

Technology

This entry records the cited source and a proposed next investigation. It makes no claim of historical abandonment, suppression, or independent reproduction.

Sources.

  1. Notes on Landauer’s principle, reversible computation, and Maxwell’s Demon

    Charles H. Bennett / IBM Research · Studies in History and Philosophy of Modern Physics; 1 September 2003; abstract.

    Author institutional abstract inspected; full argument not independently reconstructed. Checked 2026-11-18.

Record history
  1. 2026-11-18 / R1 / SOURCE_SEEDED

    Source-limited editorial seed with explicit inspection scope. Research questions and proposed experiments are not executed results.