The Mirage of Universality in Cellular Automata

by   Guillaume Theyssier, et al.

This note is a survey of examples and results about cellular automata with the purpose of recalling that there is no 'universal' way of being computationally universal. In particular, we show how some cellular automata can embed efficient but bounded computation, while others can embed unbounded computations but not efficiently. We also study two variants of Boolean circuit embedding, transient versus repeatable simulations, and underline their differences. Finally we show how strong forms of universality can be hidden inside some seemingly simple cellular automata according to some classical dynamical parameters.



page 1

page 2

page 3

page 4


Cold Dynamics in Cellular Automata: a Tutorial

This tutorial is about cellular automata that exhibit 'cold dynamics'. B...

On the classifiability of cellular automata

Based on computer simulations Wolfram presented in several papers conjec...

Descriptive complexity for minimal time of cellular automata

Descriptive complexity may be useful to design programs in a natural dec...

Conjugacy of one-dimensional one-sided cellular automata is undecidable

Two cellular automata are strongly conjugate if there exists a shift-com...

Fixed Point Constructions in Tilings and Cellular Automata

The fixed point construction is a method for designing tile sets and cel...

A framework for (de)composing with Boolean automata networks

Boolean automata networks (BANs) are a generalisation of Boolean cellula...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.