269 search results - page 18 / 54 » Computing with Probabilistic Cellular Automata |
CIE
2005
Springer
14 years 2 months ago
2005
Springer
geometrical computation: Turing-computing ability and undecidability J´erˆome Durand-Lose Laboratoire d’Informatique Fondamentale d’Orl´eans, Universit´e d’Orl´eans, B.P...
STACS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. It is well known that one-dimensional cellular automata working on the usual neighborhood are Turing complete, and many acceleration theorems are known. However very litt...
CSR
2007
Springer
14 years 17 days ago
2007
Springer
Abstract. We will show how padding techniques can be applied on onedimensional cellular automata by proving a transfer theorem on complexity classes (how one inclusion of classes i...
DNA
2005
Springer
14 years 2 months ago
2005
Springer
Recent experimental progress in DNA lattice construction, DNA robotics, and DNA computing provides the basis for designing DNA cellular computing devices, i.e. autonomous nano-mech...
MFCS
2005
Springer
14 years 2 months ago
2005
Springer