The thermodynamics of computation—a review
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Bennett showed that all computations could be performed using reversible logical operations only.
“In 1973, Bennett 28 -30 showed that all computations could be performed using reversible logical operations only.”
From Ultimate physical limits to computation (2000) · cites this paper as [29]
Cites
Theory of Self-Reproducing Automata
Schwartz, J. T., von Neumann, J., & Burks, A. W. (1967) · Mathematics of Computation · doi:10.2307/2005041 · Cited by 5,468 · see citing works
Irreversibility and heat generation in the computing process
Landauer, R. (1961) · IBM Journal of Research and Development · doi:10.1147/rd.53.0183 · Cited by 4,980 · see citing works
Logical Reversibility of Computation
Bennett, C. H. (1973) · IBM Journal of Research and Development · doi:10.1147/rd.176.0525 · Cited by 3,679 · see citing works
Self-citationEfficient estimation of free energy differences from Monte Carlo data
Bennett, C. H. (1976) · Journal of Computational Physics · doi:10.1016/0021-9991(76)90078-4 · Cited by 2,631 · see citing works
Self-citationIrreversibility and heat generation in the computing process
Landauer, R. W. (2000) · IBM Journal of Research and Development · doi:10.1147/rd.441.0261 · Cited by 2,617 · see citing works
Watson, J. D. (1970) · Cold Spring Harbor Laboratory Institutional Repository (Cold Spring Harbor Laboratory) · Cited by 2,062 · see citing works
Science and Information Theory
Brillouin, L., & Hellwarth, R. W. (1956) · Physics Today · doi:10.1063/1.3059856 · Cited by 1,928 · see citing works
Fredkin, E., & Toffoli, T. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf01857727 · Cited by 1,896 · see citing works
Hopfield, J. J. (1974) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.71.10.4135 · Cited by 1,594 · see citing works
Science and information theory
Charp, S. (1956) · Journal of the Franklin Institute · doi:10.1016/0016-0032(56)90094-1 · Cited by 1,524 · see citing works
Toffoli, T. (1980) · Lecture Notes in Computer Science · doi:10.1007/3-540-10003-2_104 · Cited by 1,523 · see citing works
�ber die Entropieverminderung in einem thermodynamischen System bei Eingriffen intelligenter Wesen
Szilard, L. (1929) · The European Physical Journal A · doi:10.1007/bf01341281 · Cited by 1,259 · see citing works
Algorithmic Information Theory
Chaitin, G. J. (1977) · IBM Journal of Research and Development · doi:10.1147/rd.214.0350 · Cited by 982 · see citing works
A Theory of Program Size Formally Identical to Information Theory
Chaitin, G. J. (1975) · Journal of the ACM · doi:10.1145/321892.321894 · Cited by 831 · see citing works
Complexity of the mover's problem and generalizations
Reif, J. H. (1979) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1979.10 · Cited by 770 · see citing works
Kinetic amplification of enzyme discrimination
Ninio, J. (1975) · Biochimie · doi:10.1016/s0300-9084(75)80139-8 · Cited by 762 · see citing works
Randomness and Mathematical Proof
Chaitin, G. J. (1975) · Scientific American · doi:10.1038/scientificamerican0575-47 · Cited by 674 · see citing works
Zvonkin, A. K., & Levin, L. A. (1970) · Russian Mathematical Surveys · doi:10.1070/rm1970v025n06abeh001269 · Cited by 650 · see citing works
Minimal Energy Dissipation in Logic
Keyes, R. W., & Landauer, R. W. (1970) · IBM Journal of Research and Development · doi:10.1147/rd.142.0152 · Cited by 267 · see citing works
Dissipation-error tradeoff in proofreading
Bennett, C. H. (1979) · Biosystems · doi:10.1016/0303-2647(79)90003-0 · Cited by 152 · see citing works
Self-citationClassical and quantum limitations on energy consumption in computation
Likharev, K. K. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf01857733 · Cited by 141 · see citing works
The Inversion of Functions Defined by Turing Machines
McCarthy, J. (1956) · Princeton University Press eBooks · doi:10.1515/9781400882618-009 · Cited by 116 · see citing works
Bicontinuous extensions of invertible combinatorial functions
Toffoli, T. (1981) · Theory of Computing Systems · doi:10.1007/bf01752388 · Cited by 107 · see citing works
Chromosomal Proteins and Gene Regulation
Stein, G. S., Stein, J., & Kleinsmith, L. J. (1975) · Scientific American · doi:10.1038/scientificamerican0275-46 · Cited by 46 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Feynman, R. P. (1986) · Foundations of Physics · doi:10.1007/bf01886518 · Cited by 1,770 · see citing works
Quantum computation and Shor's factoring algorithm
Ekert, A., & Jozsa, R. (1996) · Reviews of Modern Physics · doi:10.1103/revmodphys.68.733 · Cited by 1,354 · see citing works
Experimental verification of Landauer’s principle linking information and thermodynamics
Bérut, A., Arakelyan, A., Petrosyan, A., Ciliberto, S., Dillenschneider, R., & Lutz, E. (2012) · Nature · doi:10.1038/nature10872 · Cited by 1,248 · see citing works
Ultimate physical limits to computation
Lloyd, S. (2000) · Nature · doi:10.1038/35023282 · Cited by 1,120 · see citing works
How Small Can Thermal Machines Be? The Smallest Possible Refrigerator
Linden, N., Popescu, S., & Skrzypczyk, P. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.130401 · Cited by 453 · see citing works
Milburn, G. J. (1989) · Physical Review Letters · doi:10.1103/physrevlett.62.2124 · Cited by 440 · see citing works
High-precision test of Landauer’s principle in a feedback trap
Jun, Y., Gavrilov, M., & Bechhoefer, J. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.190601 · Cited by 428 · see citing works
Time/Space Trade-Offs for Reversible Computation
Bennett, C. H. (1989) · SIAM Journal on Computing · doi:10.1137/0218053 · Cited by 405 · see citing works
Self-citationQuantum theory cannot consistently describe the use of itself
Frauchiger, D., & Renner, R. (2018) · Nature Communications · doi:10.1038/s41467-018-05739-8 · Cited by 333 · see citing works
Information processing and the second law of thermodynamics: an inclusive, Hamiltonian approach
Deffner, S., & Jarzynski, C. (2013) · Physical Review X · doi:10.1103/physrevx.3.041003 · Cited by 231 · see citing works
Harnessing the Power of the Second Quantum Revolution
Deutsch, I. H. (2020) · PRX Quantum · doi:10.1103/prxquantum.1.020101 · Cited by 207 · see citing works
Braunstein, S. L., & Pati, A. K. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.080502 · Cited by 187 · see citing works
Reversible electronic logic using switches
Merkle, R. C. (1993) · Nanotechnology · doi:10.1088/0957-4484/4/1/002 · Cited by 178 · see citing works
Brain entropy and human intelligence: a resting-state fMRI study
Saxe, G. N., Calderone, D., & Morales, L. J. (2018) · PLoS ONE · doi:10.1371/journal.pone.0191582 · Cited by 133 · see citing works
The thermodynamic efficiency of computations made in cells across the range of life
Kempes, C. P., Wolpert, D., Cohen, Z., & Pérez-Mercader, J. (2017) · Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rsta.2016.0343 · Cited by 68 · see citing works
The Physical Meaning of the Holographic Principle
Fields, C., Glazebrook, J. F., & Marcianò, A. (2022) · Quanta · doi:10.12743/quanta.v11i1.206 · Cited by 37 · see citing works
Fundamental constraints to the logic of living systems
Solé, R., Kempes, C. P., Corominas-Murtra, B., De Domenico, M., Kolchinsky, A., Lachmann, M., Libby, E., Saavedra, S., Smith, E., & Wolpert, D. (2024) · Interface Focus · doi:10.1098/rsfs.2024.0010 · Cited by 34 · see citing works
“In this context, thermodynamics allows us to address the problem of the bounds to the efficiency of living, information-processing agents [72–76].”
BackgroundFormalizing falsification for theories of consciousness across computational hierarchies
Hanson, J. R., & Walker, S. I. (2021) · Neuroscience of Consciousness · doi:10.1093/nc/niab014 · Cited by 16 · see citing works
Geometrical optimization of spin clusters for the preservation of quantum coherence
Gassab, L., Pusuluk, O., & Müstecaplıoğlu, Ö. E. (2024) · Physical Review A · doi:10.1103/physreva.109.012424 · Cited by 8 · see citing works
- Authors
- Bennett, C. H.
- Affiliations
- IBM (United States) (US)
- Corresponding author
- Bennett, Charles H.
- ORCID
- Bennett, Charles H.
- Venue
- International Journal of Theoretical Physics
- Published
- 1982-12
- Volume
- 21
- Issue
- 12
- Pages
- 905-940
- ISSN
- 0020-7748 (ISSN-L)
- 1572-9575
- OpenAlex
- W2149158279
- Cited by
- 2,006
- References
- 24
- Citations by year
- 2026: 97 · 2025: 117 · 2024: 86 · 2023: 106 · 2022: 93 · 2021: 96 · 2020: 80 · 2019: 56 · 2018: 93 · 2017: 97 · 2016: 77 · 2015: 66 · 2014: 77 · 2013: 80 · 2012: 89
- FWCI
- 5.41
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- International Journal of Theoretical Physics (publishedVersion)
- Topics
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Advanced Thermodynamics and Statistical Mechanics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Cellular Automata and Applications
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Quantum-Dot Cellular Automata
- Keywords
- thermodynamics of computation, logical reversibility, thermal noise, random walks, DNA replication, thermodynamic cost of computation, reversible computation, Maxwell's demon, heat pumps, heat engines
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review