The goal of this paper is to show why the framework of communication complexity seems suitable for the study of cellular automata. Researchers have tackled different algorithmic p...
Eric Goles Ch., Pierre-Etienne Meunier, Ivan Rapap...
Abstract. Rule 54, in Wolfram’s notation, is one of elementary yet complexly behaving one-dimensional cellular automata. The automaton supports gliders, glider guns and other non...
Abstract—Memetics is a new science that has attracted increasing attentions in the recent decades. Beyond the formalism of simple hybrids, adaptive hybrids and memetic algorithms...
After a reminder about embryonic machines endowed with universal construction and universal computation properties, this paper presents a novel architecture providing additional s...
Abstract. We introduce a natural class of cellular automata characterised by a property of the local transition law without any assumption on the states set. We investigate some al...