Sciweavers

500 search results - page 1 / 100
» Universality and Cellular Automata
Sort
View
STACS
2005
Springer
13 years 10 months ago
How Common Can Be Universality for Cellular Automata?
Abstract. We address the problem of the density of intrinsically universal cellular automata among cellular automata or a subclass of cellular automata. We show that captive cellul...
Guillaume Theyssier
JAC
2008
13 years 6 months ago
Universalities in cellular automata a (short) survey
This reading guide aims to provide the reader with an easy access to the study of universality in the field of cellular automata. To fulfill this goal, the approach taken here is o...
Nicolas Ollinger
IANDC
2008
139views more  IANDC 2008»
13 years 5 months ago
Computational complexity of dynamical systems: The case of cellular automata
Abstract. Cellular Automata can be considered discrete dynamical systems and at the same time a model of parallel computation. In this paper we investigate the connections between ...
Pietro di Lena, Luciano Margara
JAC
2008
13 years 6 months ago
Rule 110: universality and catenations
Cellular automata are a simple model of parallel computation. Many people wonder about the computing power of such a model. Following an idea of S. Wolfram [16], M. Cook [3] has pr...
Gaétan Richard
CORR
2008
Springer
126views Education» more  CORR 2008»
13 years 7 months ago
A Particular Universal Cellular Automaton
Abstract. Signals are a classical tool of cellular automata constructions that proved to be useful for language recognition or firing-squad synchronisation. Particles and collision...
Nicolas Ollinger, Gaétan Richard