Skip to main content
Log in

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

  • Published:
computational complexity Aims and scope Submit manuscript

Abstract.

If (X,T) is a measure-preserving system, \( \alpha \) 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_{0}^{n-1})/f(n)\}_{n=1}^{\infty} \) 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_{0}^{n-1} \) and nf(log2(n))/log2(n). A similar statement also holds for the limit superior.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: August 20, 1999.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Blume, F. On the relation between entropy and the average complexity of trajectories in dynamical systems. Comput. complex. 9, 146–155 (2000). https://doi.org/10.1007/PL00001604

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00001604

Navigation