In this paper, we give an elaborate and understandable review of traffic cellular automata
(TCA) models, which are a class of computationally efficient microscopic traffic flow models …

Classification is one of the most important problems in the theory of CA. For instance,
assessing how CA design choices impact the generated dynamics requires an overview of …

Ming Li Paul Vitányi Fourth Edition Page 1 An Introduction to Kolmogorov Complexity and Its
Applications Ming Li Paul Vitányi Fourth Edition Texts in Computer Science Page 2 Texts in …

The first edition of the monograph Information and Randomness: An Algorithmic Perspective
by Crist ian Calude was published in 1994. In my Foreword I said:" The research in …

A method for studying the qualitative dynamical properties of abstract computing machines
based on the approximation of their program-size complexity using a general lossless …

We study the predictability of emergent phenomena in complex systems. Using nearest-
neighbor, one-dimensional cellular automata (CA) as an example, we show how to construct …

We utilise the 0–1 test to automatically classify elementary cellular automata. The
quantitative results of the 0–1 test reveal a number of advantages over Wolfram's qualitative …

In order to describe the sensitivity of a cellular automaton (CA) to a small change in its initial
configuration, one can attempt to extend the notion of Lyapunov exponents as defined for …

Lempel-Ziv complexity measure has been used to estimate the entropy density of a string. It
is defined as the number of factors in a production factorization of a string. In this …

While there has been a keen interest in studying computation at the edge of chaos for
dynamical systems undergoing a phase transition, this has come under question for cellular …