Entropy Production Bounds the Accuracy of Computation in Markov Networks

Abstract

Biological and artificial networks compute by transforming time-dependent inputs into functional outputs. Because the internal state of a stochastic network relaxes on finite timescales, its output generally lags behind a changing environment, producing computational errors. We show that for reversible continuous-time Markov networks the error admits a universal thermodynamic bound. Decomposing the total error into representation and lag contributions, we derive an inequality relating the lag error to the entropy production rate and a memory time equal to the integrated equilibrium autocorrelation of the output observable. The bound implies that accurate dynamical computation requires either substantial dissipation or long-lived memory encoded in slowly relaxing modes. We demonstrate these principles in artificial Markov networks and in models of biochemical information processing. Our results establish a thermodynamic limit on information processing in stochastic networks and provide a quantitative framework for understanding the energetic costs of biological computation.