Information accessibility and cryptic processes

DOI10.1088/1751-8113/42/36/362002MaRDI QIDQ3650358zbMATH OpenOpenAlexFDO

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

Publication date 14 December 2009

Published in Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Cryptography (94A60)

Abstract: We give a systematic expansion of the crypticity--a recently introduced measure of the inaccessibility of a stationary process's internal state information. This leads to a hierarchy of k-cryptic processes and allows us to identify finite-state processes that have infinite crypticity--the internal state information is present across arbitrarily long, observed sequences. The crypticity expansion is exact in both the finite- and infinite-order cases. It turns out that k-crypticity is complementary to the Markovian finite-order property that describes state information in processes. One application of these results is an efficient expansion of the excess entropy--the mutual information between a process's infinite past and infinite future--that is finite and exact for finite-order cryptic processes.

Recommendations

• How hidden are hidden processes? A primer on crypticity and entropy convergence
• Regularities unseen, randomness observed: Levels of entropy convergence
• On hidden Markov processes with infinite excess entropy
• Anatomy of a bit: information in a time series observation
• Shannon entropy rate of hidden Markov processes

Cited in

(8)

• Prediction, retrodiction, and the amount of information stored in the present
• On hidden Markov processes with infinite excess entropy
• Spectral simplicity of apparent complexity. I: The nondiagonalizable metadynamics of prediction
• Tradeoff Relations Between Accessible Information, Informational Power, and Purity
• Synchronization and control in intrinsic and designed computation: An information-theoretic analysis of competing models of stochastic computation
• Information symmetries in irreversible processes
• How hidden are hidden processes? A primer on crypticity and entropy convergence
• Asymptotic synchronization for finite-state sources

This page was built for publication: Information accessibility and cryptic processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3650358)