Sciweavers

139 search results - page 9 / 28
» How Common Can Be Universality for Cellular Automata
Sort
View
HPCS
2006
IEEE
14 years 1 months ago
Toward a Software Infrastructure for the Cyclops-64 Cellular Architecture
This paper presents the initial design of the Cyclops-64 (C64) system software infrastructure and tools under development as a joint effort between IBM T.J. Watson Research Center...
Juan del Cuvillo, Weirong Zhu, Ziang Hu, Guang R. ...
MCU
1998
154views Hardware» more  MCU 1998»
13 years 9 months ago
A computation-universal two-dimensional 8-state triangular reversible cellular automaton
A reversible cellular automaton (RCA) is a cellular automaton (CA) whose global function is injective and every configuration has at most one predecessor. Margolus showed that the...
Katsunobu Imai, Kenichi Morita
CIE
2005
Springer
14 years 1 months ago
Abstract Geometrical Computation: Turing-Computing Ability and Undecidability
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...
Jérôme Durand-Lose
ICCD
2004
IEEE
79views Hardware» more  ICCD 2004»
14 years 4 months ago
Using Circuits and Systems-Level Research to Drive Nanotechnology
This paper details nano-scale devices being researched by physical scientists to build computational systems. It also reviews some existing system design work that uses the device...
Michael T. Niemier, Ramprasad Ravichandran, Peter ...
ARCS
2008
Springer
13 years 9 months ago
How Efficient are Creatures with Time-shuffled Behaviors?
: The task of the creatures in the "creatures' exploration problem" is to visit all empty cells in an environment with a minimum number of steps. We have analyzed th...
Patrick Ediger, Rolf Hoffmann, Mathias Halbach