本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：2011
摘要
We investigate a stationary process's crypticity-a measure of the difference between its hidden state 資訊 and its observed 資訊-using the causal states of 計算 mechanics. Here, we motivate crypticity and cryptic order as physically meaningful quantities that monitor how hidden a hidden process is. This is done by recasting previous results on the convergence of block 熵 and block-state 熵 in a geometric setting, one that is more intuitive and that leads to a number of new results. For example, we connect crypticity to how an observer synchronizes to a process. We show that the block-causal-state 熵 is a convex function of block length. We give a complete analysis of spin chains. We present a classification scheme that surveys stationary processes in terms of their possible cryptic and 馬可夫 orders.
※ 此為已發表論文，全文需透過期刊付費取得