The thermodynamics of computation—a review

By Charles H. Bennett. 1982

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Optimal Ordered Problem Solver (2002, neutral): “…0.003) prepares the foundations: Instruction c3 pushes 3; dec decrements this; boostq takes the result 2 as an argument (interpreted as an address) and thus boosts the probabilities of all components of the 2nd frozen program, which happens to be the previously found universal 1 n 2 n -solver.”
Statistical Mechanics: Entropy, Order Parameters, and Complexity (2021, unknown): “It can be tiny for small undercoolings.(15)”
Algorithmic Self-Assembly of DNA (2006, background): “Bennett (1982) goes farther and imagines designing a set of enzymes to simulate the operation of an arbitrary Turing Machine, but these ideas were never implemented because of the difficulty of designing enzymes de novo.”
Biomolecular computing systems: principles, progress and potential (2012, methodology): “A hypothetical autonomous Turing machine made of RNA molecules and modifying enzymes was put forward as an example of an energy-efficient computer 45 .”
Physical one-way functions (2001, background): “Bennett [71] has pointed out that, for a thermodynamic ensemble, the average Kolmogorov complexity is equal to the statistical ensemble entropy.”
Nonequilibrium Thermodynamics of Chemical Reaction Networks: Wisdom from Stochastic Thermodynamics (2016, background): “Also, since transient signals in CRNs can be used for computation [118] and have been shown to display Turing-universality [119– 122], one should be able to study the thermodynamic cost of chemical computing [123].”
QUANTUM KOLMOGOROV COMPLEXITY AND ITS APPLICATIONS (2006, background): “Bennett [8] and later Zurek [19] showed that the Ko-mogorov complexity of the microstates of a system is a fundamental quantity in the thermodynamics analysis of such problems.”
The resource theory of informational nonequilibrium in thermodynamics (2013, background): “Bennett was perhaps the first to suggest that an initialized memory tape was capable of storing work (Bennett, 1982).”
An Introduction to Kolmogorov Complexity and Its Applications (1993, unknown): “[35] Let x be a finite binary sequence of length n with Ii = Xl + X2 + .”
Thermodynamics of information (2015, background): “Using the definition of mutual information (see Box 2), the nonequilibrium free energy (8) of the compound system when there is no interaction energy can be readily expressed as”
Physical One-Way Functions (2002, background): “Bennett [71] has pointed out that, for a thermodynamic ensemble, the average Kolmogorov complexity is equal to the statistical ensemble entropy.”