Prediction, retrodiction, and the amount of information stored in the present

DOI10.1007/s10955-009-9808-zzbMath1177.82054arXiv0905.3587OpenAlexW2137492591MaRDI QIDQ1040715

James P. Crutchfield, Christopher J. Ellison, John R. Mahoney

Publication date: 25 November 2009

Published in: Journal of Statistical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0905.3587

zbMATH Keywords

entropy rateexcess entropystatistical complexitycausal irreversibilitycrypticitystored information

Mathematics Subject Classification ID

Cryptography (94A60) Stochastic methods applied to problems in equilibrium statistical mechanics (82B31)

Related Items

Exact complexity: the spectral decomposition of intrinsic computation, Statistical signatures of structural organization: the case of long memory in renewal processes, Shortcuts to thermodynamic computing: the cost of fast and faithful information processing, Information anatomy of stochastic equilibria, Predictive rate-distortion for infinite-order Markov processes, Spectral simplicity of apparent complexity. I. The nondiagonalizable metadynamics of prediction, Informational and causal architecture of continuous-time renewal processes, Computational mechanics of input-output processes: structured transformations and the \(\epsilon\)-transducer, Optimality and complexity in measured quantum-state stochastic processes, Asymptotic synchronization for finite-state sources, On hidden Markov processes with infinite excess entropy, QUANTIFYING EMERGENCE IN TERMS OF PERSISTENT MUTUAL INFORMATION, Pairwise correlations in layered close-packed structures, Synchronization and control in intrinsic and designed computation: An information-theoretic analysis of competing models of stochastic computation, Optimal causal inference: Estimating stored information and approximating causal architecture, Information symmetries in irreversible processes, Anatomy of a bit: Information in a time series observation, How hidden are hidden processes? A primer on crypticity and entropy convergence, Ergodic parameters and dynamical complexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The calculi of emergence: Computation, dynamics and induction
• Subshifts of finite type and sofic systems
• Reductions of hidden information sources
• Predictability, Complexity, and Learning
• Communication Theory of Secrecy Systems*
• Information accessibility and cryptic processes
• A new outlook on Shannon's information measures
• Hidden Markov processes
• Nonlinear Time Series Analysis
• Elements of Information Theory
• Regularities unseen, randomness observed: Levels of entropy convergence
• Computational mechanics: pattern and prediction, structure and simplicity.