Information Accessibility and Cryptic Processes Export

@article{citeulike:4967324, 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.}, archivePrefix = {arXiv}, author = {Mahoney, John R. and Ellison, Christopher J. and Crutchfield, James P.}, citeulike-article-id = {4967324}, citeulike-linkout-0 = {http://arxiv.org/abs/0905.4787}, citeulike-linkout-1 = {http://arxiv.org/pdf/0905.4787}, eprint = {0905.4787}, keywords = {complexity-measures, computational-mechanics, crypticity, statistical-complexity}, month = {May}, posted-at = {2009-06-26 05:57:12}, priority = {2}, title = {Information Accessibility and Cryptic Processes}, url = {http://arxiv.org/abs/0905.4787}, year = {2009} }

TY - JOUR ID - citeulike:4967324 L3 - citeulike-article-id:4967324 N2 - 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. TI - Information Accessibility and Cryptic Processes KW - complexity-measures KW - computational-mechanics KW - crypticity KW - statistical-complexity AU - Mahoney, John AU - Ellison, Christopher AU - Crutchfield, James PY - 2009/May/29/ UR - http://arxiv.org/abs/0905.4787 ER -