期刊
DISCRETE AND CONTINUOUS DYNAMICAL SYSTEMS
卷 7, 期 3, 页码 477-486出版社
SOUTHWEST MISSOURI STATE UNIV
DOI: 10.3934/dcds.2001.7.477
关键词
topological dynamical systems; information; coding; entropy; orbit complexity
We consider data compression algorithms as a tool to get an approximate measure for the quantity of information contained in a string. By this it is possible to give a notion of orbit complexity for topological dynamical systems. In compact ergodic dynamical systems, entropy is almost everywhere equal to orbit complexity. The use of compression algorithms allows a direct estimation of the information content of the orbits.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据