Information symmetries in irreversible processes
From MaRDI portal
Publication:5264345
DOI10.1063/1.3637490zbMath1317.60088arXiv1107.2168WikidataQ46219403 ScholiaQ46219403MaRDI QIDQ5264345
Jörg Reichardt, John R. Mahoney, James P. Crutchfield, Ryan G. James, 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/1107.2168
60J10: Markov chains (discrete-time Markov processes on discrete state spaces)
65C40: Numerical analysis or methods applied to Markov chains
Related Items
The fundamental thermodynamic bounds on finite models, How hidden are hidden processes? A primer on crypticity and entropy convergence, Predictive rate-distortion for infinite-order Markov processes
Cites Work
- Unnamed Item
- Unnamed Item
- On locally reversible languages
- Prediction, retrodiction, and the amount of information stored in the present
- Toward a quantitative theory of self-generated complexity
- Sofic systems
- Nonequilibrium measurements of free energy differences for microscopically reversible Markovian systems
- The calculi of emergence: Computation, dynamics and induction
- Subshifts of finite type and sofic systems
- Predictability, Complexity, and Learning
- QUANTIFYING EMERGENCE IN TERMS OF PERSISTENT MUTUAL INFORMATION
- ON THE GENERATIVE NATURE OF PREDICTION
- Information accessibility and cryptic processes
- Inference of Reversible Languages
- A new outlook on Shannon's information measures
- Identifiability of hidden Markov information sources and their minimum degrees of freedom
- The structure of the I-measure of a Markov chain
- Hidden Markov processes
- An Introduction to Symbolic Dynamics and Coding
- Synchronization and control in intrinsic and designed computation: An information-theoretic analysis of competing models of stochastic computation
- Anatomy of a bit: Information in a time series observation
- How hidden are hidden processes? A primer on crypticity and entropy convergence
- Elements of Information Theory
- Statistical Inference for Probabilistic Functions of Finite State Markov Chains
- Regularities unseen, randomness observed: Levels of entropy convergence
- On the Identifiability Problem for Functions of Finite Markov Chains
- Computational mechanics: pattern and prediction, structure and simplicity.