Reductions of hidden information sources

DOI10.1007/s10955-005-6797-4zbMath1144.94377arXivmath/0405425OpenAlexW3101702052MaRDI QIDQ2583194

Nihat Ay, James P. Crutchfield

Publication date: 13 January 2006

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

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

Mathematics Subject Classification ID

Discrete-time Markov processes on general state spaces (60J05) Stochastic methods (Fokker-Planck, Langevin, etc.) applied to problems in time-dependent statistical mechanics (82C31) Measures of information, entropy (94A17)

Related Items (5)

Properties of the statistical complexity functional and partially deterministic HMMs ⋮ Predictive models and generative complexity ⋮ ON THE GENERATIVE NATURE OF PREDICTION ⋮ Prediction, retrodiction, and the amount of information stored in the present ⋮ Optimal causal inference: Estimating stored information and approximating causal architecture

Cites Work

• The calculi of emergence: Computation, dynamics and induction
• Identifiability of hidden Markov information sources and their minimum degrees of freedom
• On the Identifiability Problem for Functions of Finite Markov Chains
• Computational mechanics: pattern and prediction, structure and simplicity.

This page was built for publication: Reductions of hidden information sources