The fundamental thermodynamic bounds on finite models
arXiv:1912.03217 · doi:10.1063/5.0044741
Abstract
The minimum heat cost of computation is subject to bounds arising from Landauer's principle. Here, I derive bounds on finite modelling -- the production or anticipation of patterns (time-series data) -- by devices that model the pattern in a piecewise manner and are equipped with a finite amount of memory. When producing a pattern, I show that the minimum dissipation is proportional to the information in the model's memory about the pattern's history that never manifests in the device's future behaviour and must be expunged from memory. I provide a general construction of model that allow this dissipation to be reduced to zero. By also considering devices that consume, or effect arbitrary changes on a pattern, I discuss how these finite models can form an information reservoir framework consistent with the second law of thermodynamics.
Author accepted manuscript
References in corpus (6)
- Work and information processing in a solvable model of Maxwell's demon
- The thermodynamics of prediction
- Above and Beyond the Landauer Bound: Thermodynamics of Modularity
- A practical, unitary simulator for non-Markovian complex processes
- Thermal Efficiency of Quantum Memory Compression
- Prediction and Generation of Binary Markov Processes: Can a Finite-State Fox Catch a Markov Mouse?