A. Crisanti et al., APPLYING ALGORITHMIC COMPLEXITY TO DEFINE CHAOS IN THE MOTION OF COMPLEX-SYSTEMS, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics, 50(3), 1994, pp. 1959-1967
We define chaotic motion for dynamical systems acting in finite, discr
ete spaces via the deterministic randomness of their trajectories. The
theory of algorithmic complexity is used to provide the meaning of ra
ndomness for symbolic sequences derived from these trajectories, and a
practical test of randomness is devised on the basis of an ideal, phy
sically motivated, model of a computer. Two examples-a discretized sta
ndard map, and a fully connected neural network-are studied analytical
ly and numerically.