500 search results - page 5 / 100 » Universality and Cellular Automata |
111
click to vote
AUTOMATICA
2008
14 years 8 months ago
2008
Cellular learning automata is a combination of cellular automata and learning automata. The synchronous version of cellular learning automata in which all learning automata in dif...
92
Voted
JAC
2008
14 years 11 months ago
2008
In this paper, we study amalgamations of cellular automata (CA), i.e. ways of combining two CA by disjoint union. We show that for several families of CA obtained by simple amalgam...
CEC
2007
IEEE
15 years 3 months ago
2007
IEEE
— We aim to search for cellular automata candidate to an automatic system for the demonstration of collision-based universality and that can be able to simulate Turing machines i...
IJBC
2007
14 years 9 months ago
2007
In this tutorial, we present optimal Cellular Nonlinear Network (CNN) templates for implementing linearly-separable one-dimensional (1-D) Cellular Automata (CA). From the gallery ...
ICANN
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. We investigate the computational capabilities of probabilistic cellular automata by means of the density classification problem. We find that a specific probabilistic ...