Sciweavers

244 search results - page 35 / 49
» Turing machines and bimachines
Sort
View
MST
1998
76views more  MST 1998»
13 years 7 months ago
Sharply Bounded Alternation and Quasilinear Time
We de ne the sharply bounded hierarchy, SBH(QL), a hierarchy of classes within P, using quasilinear-time computation and quanti cation over strings of length logn. It generalizes ...
Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith
CORR
2010
Springer
112views Education» more  CORR 2010»
13 years 7 months ago
Negative Interactions in Irreversible Self-Assembly
This paper explores the use of negative (i.e., repulsive) interactions in the abstract Tile Assembly Model defined by Winfree. Winfree in his Ph.D. thesis postulated negative inte...
David Doty, Lila Kari, Benoît Masson
ENTCS
2007
150views more  ENTCS 2007»
13 years 7 months ago
On the Expressiveness of Mobile Synchronizing Petri Nets
In recent papers we have introduced Mobile Synchronizing Petri Nets, a new model for mobility based on coloured Petri Nets. It allows the description of systems composed of a coll...
Fernando Rosa Velardo, David de Frutos-Escrig, Olg...
PPL
2007
112views more  PPL 2007»
13 years 7 months ago
Embodied Computation
The traditional computational devices and models, such as the von Neumann architecture or the Turing machine, are strongly influenced by concepts of central control and perfectio...
Heiko Hamann, Heinz Wörn
MFCS
2010
Springer
13 years 5 months ago
Robust Computations with Dynamical Systems
Abstract. In this paper we discuss the computational power of Lipschitz dynamical systems which are robust to infinitesimal perturbations. Whereas the study in [1] was done only f...
Olivier Bournez, Daniel S. Graça, Emmanuel ...