Asymptotic Cellular Complexity

We show here how to construct a cellular automaton whose asymptotic set (the set of configurations it converges to) is maximally complex: it contains only configurations of maximal Kolmogorov complexity. This cellular automaton hence exhibits the most complex possible asymptotic behavior.

• Type: Journal
• Year: 2009
• Where: DLT
• Authors: Bruno Durand, Victor Poupet
• Keywords: Cellular Automaton, DLT 2009, Maximal Kolmogorov Complexity, Possible Asymptotic Behavior, Theoretical Computer Science