84 search results - page 1 / 17 » The Computational Power of Benenson Automata |
CORR
2004
Springer
13 years 4 months ago
2004
Springer
The development of autonomous molecular computers capable of making independent decisions in vivo regarding local drug administration may revolutionize medical science. Recently B...
NC
2010
13 years 3 months ago
2010
Abstract. Inspired by P systems initiated by Gheorghe P˜aun, we study a computation model over a multiset of communicating objects. The objects in our model are instances of fini...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
We define a new transfinite time model of computation, infinite time cellular automata. The model is shown to be as powerful than infinite time Turing machines, both on finite and ...
PODS
2002
ACM
14 years 5 months ago
2002
ACM
We introduce and investigate a distributed computation model for querying the Web. Web queries are computed by interacting automata running at different nodes in the Web. The auto...
ICALP
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. We consider systems of finite automata performing together computation on an input string. Each automaton has its own read head that moves independently of the other head...