Time Series of Rational Partitions and Complexity of One-dimensional Processes
Alberto Albrigi
Mario Casartelli
Dipartimento di Fisica,
Università degli Studi di Parma,
Viale delle Scienze, 43100 Parma, Italy
Abstract
Time series based on couples of partitions, and a related reduction algorithm, are used to develop indicators of complexity for general one-dimensional processes with discretizable states. After introducing the calculation scheme, we provide algorithms for some typical examples (cellular automata and iterated maps). Experiments show the sensitivity of these indicators---to complexity in the intuitive sense, and to hidden features distinguishing complexity from ordinary randomness.
