On the relation between entropy and the average complexity of trajectories in dynamical systems

被引:6
作者
Blume, F [1 ]
机构
[1] John Brown Univ, Dept Math, Siloam Springs, AR 72761 USA
关键词
entropy; measure-preserving transformations; algorithmic complexity; convergence rates;
D O I
10.1007/PL00001604
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
If (X,T) is a measure-preserving system, ct a nontrivial partition of X into two sets and f a positive increasing function defined on the positive real numbers, then the limit inferior of the sequence (2H(alpha (n-1)(0))/f(n))(n=1)(infinity) is greater than or equal to the limit inferior of the sequence of quotients of the average complexity of trajectories of length n generated by alpha (n-1)(0) and nf(log(2)(n))/(log(2)(n). A similar statement. also holds for the limit superior.
引用
收藏
页码:146 / 155
页数:10
相关论文
共 7 条
[1]   Possible rates of entropy convergence [J].
Blume, F .
ERGODIC THEORY AND DYNAMICAL SYSTEMS, 1997, 17 :45-70
[2]   Minimal rates of entropy convergence for rank one systems [J].
Blume, F .
DISCRETE AND CONTINUOUS DYNAMICAL SYSTEMS, 2000, 6 (04) :773-796
[3]   Minimal rates of entropy convergence for completely ergodic systems [J].
Blume, F .
ISRAEL JOURNAL OF MATHEMATICS, 1998, 108 (1) :1-12
[4]  
Blume F., 1995, THESIS U N CAROLINA
[5]  
Brudno A. A., 1983, T MOSCOW MATH SOC, V44, P127
[6]  
JONES ND, 1973, COMPUTABILITY THEORY
[7]  
White H.S., 1991, THESIS U N CAROLINA