Time's Barbed Arrow: Irreversibility, Crypticity, and Stored Information

Abstract

We show why the amount of information communicated between the past and future--the excess entropy--is not in general the amount of information stored in the present--the statistical complexity. This is a puzzle, and a long-standing one, since the latter is what is required for optimal prediction, but the former describes observed behavior. We layout a classification scheme for dynamical systems and stochastic processes that determines when these two quantities are the same or different. We do this by developing closed-form expressions for the excess entropy in terms of optimal causal predictors and retrodictors--the epsilon-machines of computational mechanics. A process's causal irreversibility and crypticity are key determining properties.

4 pages, 2 figures

Cited by in corpus (54)

• Weak Values are Interference Phenomena
• Occam's Quantum Razor: How Quantum Mechanics can reduce the complexity of classical models
• Anatomy of a Bit: Information in a Time Series Observation
• Prediction, Retrodiction, and The Amount of Information Stored in the Present
• Above and Beyond the Landauer Bound: Thermodynamics of Modularity
• Demon Dynamics: Deterministic Chaos, the Szilard Map, and the Intelligence of Thermodynamic Systems
• Computational Mechanics of Input-Output Processes: Structured transformations and the $\epsilon$-transducer
• Experimental quantum processing enhancement in modelling stochastic processes
• What did Erwin Mean? The Physics of Information from the Materials Genomics of Aperiodic Crystals and Water to Molecular Information Catalysts and Life
• Does the brain behave like a (complex) network? I. Dynamics
• Chaos Forgets and Remembers: Measuring Information Creation, Destruction, and Storage
• A Closed-Form Shave from Occam's Quantum Razor: Exact Results for Quantum Compression
• Information Content of Turbulence
• Many Roads to Synchrony: Natural Time Scales and Their Algorithms
• Informational and Causal Architecture of Discrete-Time Renewal Processes
• Informational and Causal Architecture of Continuous-time Renewal and Hidden Semi-Markov Processes
• Thermodynamics of complexity and pattern manipulation
• Superior memory efficiency of quantum devices for the simulation of continuous-time stochastic processes
• Quantum instruments as a foundation for both states and observables
• Synchronization and Control in Intrinsic and Designed Computation: An Information-Theoretic Analysis of Competing Models of Stochastic Computation
• Transient Dissipation and Structural Costs of Physical Information Transduction
• Information Symmetries in Irreversible Processes
• General anesthesia reduces complexity and temporal asymmetry of the informational structures derived from neural recordings in Drosophila
• Unbounded memory advantage in stochastic simulation using quantum mechanics
• Matrix Product States for Quantum Stochastic Modelling
• Causal Asymmetry in a Quantum World
• Interfering trajectories in experimental quantum-enhanced stochastic simulation
• Information-theoretic bound on the energy cost of stochastic simulation
• Information Anatomy of Stochastic Equilibria
• How Hidden are Hidden Processes? A Primer on Crypticity and Entropy Convergence
• Statistical Signatures of Structural Organization: The case of long memory in renewal processes
• Memory compression and thermal efficiency of quantum implementations of non-deterministic hidden Markov models
• Single-shot quantum memory advantage in the simulation of stochastic processes
• Thermal Efficiency of Quantum Memory Compression
• Robust inference of memory structure for efficient quantum modelling of stochastic processes
• Spectral Simplicity of Apparent Complexity, Part I: The Nondiagonalizable Metadynamics of Prediction
• Discovering Causal Structure with Reproducing-Kernel Hilbert Space $\epsilon$-Machines
• Enumerating Finitary Processes
• An Information-Theoretic Formalism for Multiscale Structure in Complex Systems
• The Markov Memory for Generating Rare Events
• Thermodynamically-Efficient Local Computation and the Inefficiency of Quantum Memory Compression
• The Past and the Future in the Present
• Circumventing the Curse of Dimensionality in Prediction: Causal Rate-Distortion for Infinite-Order Markov Processes
• Trimming the Independent Fat: Sufficient Statistics, Mutual Information, and Predictability from Effective Channel States
• Error-tolerant witnessing of divergences in classical and quantum statistical complexity
• Quantum Statistical Complexity Measure as a Signalling of Correlation Transitions
• The Origins of Computational Mechanics: A Brief Intellectual History and Several Clarifications
• Limits on Inferring the Past
• Optimality and Complexity in Measured Quantum-State Stochastic Processes
• Measuring complexity
• Intrinsic computation of a Monod-Wyman-Changeux molecule
• An entropic characterization of long memory stationary process
• The fundamental thermodynamic bounds on finite models
• Ideal stochastic process modeling with post-quantum quasiprobabilistic theories