Thermodynamics of complexity and pattern manipulation

Abstract

Many organisms capitalize on their ability to predict the environment to maximize available free energy, and reinvest this energy to create new complex structures. This functionality relies on the manipulation of patterns - temporally ordered sequences of data. Here, we propose a framework to describe pattern manipulators -- devices that convert thermodynamic work to patterns or vice versa - and use them to build a 'pattern engine' that facilitates a thermodynamic cycle of pattern creation and consumption. We show that the least heat dissipation is achieved by the provably simplest devices; the ones that exhibit desired operational behaviour while maintaining the least internal memory. We derive the ultimate limits of this heat dissipation, and show that it is generally non-zero and connected with the pattern's intrinsic crypticity - a complexity theoretic quantity that captures the puzzling difference between the amount of information the pattern's past behaviour reveals about its future, and the amount one needs to communicate about this past to optimally predict the future.

Authors' accepted manuscript. Previously known as "When is simpler thermodynamically better?" 9 pages + 13 page appendix, 6 figures

References in corpus (12)

• Quantum Thermodynamics
• The role of quantum information in thermodynamics --- a topical review
• Work and information processing in a solvable model of Maxwell's demon
• The thermodynamics of prediction
• Quantum Szilard Engine
• Stochastic thermodynamics with information reservoirs
• Local effective dynamics of quantum systems: A generalized approach to work and heat
• Identifying Functional Thermodynamics in Autonomous Maxwellian Ratchets
• Correlation-powered Information Engines and the Thermodynamics of Self-Correction
• A Closed-Form Shave from Occam's Quantum Razor: Exact Results for Quantum Compression
• Using quantum theory to reduce the complexity of input-output processes
• Thermodynamics of quantum informational systems - Hamiltonian description

Cited by in corpus (17)

• Stochastic thermodynamics of computation
• Above and Beyond the Landauer Bound: Thermodynamics of Modularity
• Experimental quantum processing enhancement in modelling stochastic processes
• Extreme Quantum Advantage for Rare-Event Sampling
• Superior memory efficiency of quantum devices for the simulation of continuous-time stochastic processes
• Unbounded memory advantage in stochastic simulation using quantum mechanics
• Transient Dissipation and Structural Costs of Physical Information Transduction
• Matrix Product States for Quantum Stochastic Modelling
• Causal Asymmetry in a Quantum World
• Memory compression and thermal efficiency of quantum implementations of non-deterministic hidden Markov models
• Shortcuts to Thermodynamic Computing: The Cost of Fast and Faithful Erasure
• Thermodynamically-Efficient Local Computation and the Inefficiency of Quantum Memory Compression
• Provable superior accuracy in machine learned quantum models
• Engines for predictive work extraction from memoryful quantum stochastic processes
• The fundamental thermodynamic bounds on finite models
• Ideal stochastic process modeling with post-quantum quasiprobabilistic theories
• Energetic advantages for quantum agents in online execution of complex strategies