arXiv (All)
open access
The meaning of entropy (demonstration of a much needed theorem)
The association of information with entropy has been argued on plausibility arguments involving the operation of imaginary engines and beings, and it is not a universal theorem. In this paper, a theorem by Charles Bennett on reversible computation that associates entropy with erasure of information
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Shannon entropy: a rigorous notion at the crossroads between probability, information theory, dynamical systems and statistical physics#398849
- Readable Configuration Series I: Entropy — A Non-Modal Fixation#170118
- THE MARKOV BLANKET AT SCALE Free Energy Minimization as the Mechanism of Structural Suppression, with a φ-Necessity Result#75751
- Observer as System Completer ─ Relational Deterministic Substrate and Qualia Fixation in the Quantum Observer Problem#103254
- A simple proof of the group-theoretic Zhang-Yeung inequality#1130036
Record · ID 1061563
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive