本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：2001
摘要
Particle-like objects are observed to propagate and interact in many spatially extended dynamical systems. For one of the simplest classes of such systems, one-dimensional 細胞自動機, we establish a rigorous upper bound on the number of distinct products that these interactions can generate. The upper bound is controlled by the structural complexity of the interacting particles - a quantity which is defined here and which measures the amount of spatio-temporal 資訊 that a particle stores. Along the way we establish a number of properties of domains and particles that follow from the 計算 mechanics analysis of 細胞自動機; thereby elucidating why that approach is of general utility. The upper bound is tested against several relatively complex domain-particle 細胞自動機 and found to be tight. (C) 2001 Published
※ 此為已發表論文，全文需透過期刊付費取得