For dynamical systems, entropy rate and algorithmic complexity of the trajectories are related by a theorem of Brudno, that the equality K ( x ; T ) = h ( T ) {\displaystyle K(x;T)=h(T)} holds for almost all x {\displaystyle x} .[16]