信息可及性和保密过程
Information Accessibility and Cryptic Processes
摘要：
我们给出了一个系统的扩展的crypticity-最近推出的措施，一个固定的过程的内部状态信息的不可访问性。这导致了一个层次的k-神秘过程，并允许我们识别具有无限神秘性的有限状态过程-内部状态信息存在于任意长的观测序列中。在有限阶和无限阶情况下，隐式展开都是精确的。事实证明，k-密码性是对描述过程中状态信息的马尔可夫有限阶性质的补充。这些结果的一个应用是一个有效的扩展的过剩熵-一个过程的无限的过去和无限的未来之间的互信息-这是有限的和精确的有限阶神秘的过程。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
