How hidden are hidden processes? A primer on crypticity and entropy convergence
From MaRDI portal
Publication:5264348
DOI10.1063/1.3637502zbMath1317.94040arXiv1108.1510OpenAlexW3103122548WikidataQ46666503 ScholiaQ46666503MaRDI QIDQ5264348
John R. Mahoney, Ryan G. James, James P. Crutchfield, Christopher J. Ellison
Publication date: 27 July 2015
Published in: Chaos: An Interdisciplinary Journal of Nonlinear Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1108.1510
Related Items (3)
Spectral simplicity of apparent complexity. I. The nondiagonalizable metadynamics of prediction ⋮ The fundamental thermodynamic bounds on finite models ⋮ Information symmetries in irreversible processes
Cites Work
- Prediction, retrodiction, and the amount of information stored in the present
- Information accessibility and cryptic processes
- A new outlook on Shannon's information measures
- SYNCHRONIZING TO THE ENVIRONMENT: INFORMATION-THEORETIC CONSTRAINTS ON AGENT LEARNING
- Synchronization and control in intrinsic and designed computation: An information-theoretic analysis of competing models of stochastic computation
- Information symmetries in irreversible processes
- Anatomy of a bit: Information in a time series observation
- Regularities unseen, randomness observed: Levels of entropy convergence
- Computational mechanics: pattern and prediction, structure and simplicity.
This page was built for publication: How hidden are hidden processes? A primer on crypticity and entropy convergence
