Spectral simplicity of apparent complexity. II. Exact complexities and complexity spectra

DOI10.1063/1.4986248zbMath1462.62757arXiv1706.00883OpenAlexW2622715086WikidataQ52335839 ScholiaQ52335839MaRDI QIDQ4565945

James P. Crutchfield, Paul M. Riechers

Publication date: 13 June 2018

Published in: Chaos: An Interdisciplinary Journal of Nonlinear Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Inference from stochastic processes and prediction (62M20) Inference from stochastic processes and spectral analysis (62M15) Markov processes: estimation; hidden Markov models (62M05) Applications of statistics to physics (62P35) Statistical aspects of information-theoretic topics (62B10) Prediction theory (aspects of stochastic processes) (60G25)

Related Items (3)

Optimality and complexity in measured quantum-state stochastic processes ⋮ Shannon entropy rate of hidden Markov processes ⋮ Strong and weak optimizations in classical and quantum models of stochastic processes

Cites Work

• Unnamed Item
• Unnamed Item
• Pairwise correlations in layered close-packed structures
• Spectral simplicity of apparent complexity. I. The nondiagonalizable metadynamics of prediction
• 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
• The two-armed-bandit problem with time-invariant finite memory
• Regularities unseen, randomness observed: Levels of entropy convergence

This page was built for publication: Spectral simplicity of apparent complexity. II. Exact complexities and complexity spectra