9 search results - page 1 / 2 » Cellular Automata, Decidability and Phasespace |
FUIN
2010
13 years 2 months ago
2010
Abstract. Cellular automata have rich computational properties and, at the same time, provide plausible models of physics-like computation. We study decidability issues in the phas...
SIAMCOMP
2002
13 years 4 months ago
2002
Linear quantum cellular automata were introduced recently as one of the models of quantum computing. A basic postulate of quantum mechanics imposes a strong constraint on any quan...
DLT
2008
13 years 6 months ago
2008
DMCS
2003
13 years 6 months ago
2003
CORR
2008
Springer
13 years 6 months ago
2008
Springer
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...