Sciweavers

214 search results - page 7 / 43
» On Turing machines, dynamical systems and the Atiyah problem
Sort
View
CORR
2010
Springer
140views Education» more  CORR 2010»
13 years 7 months ago
Decision Problems for Petri Nets with Names
We prove several decidability and undecidability results for -PN, an extension of P/T nets with pure name creation and name management. We give a simple proof of undecidability of...
Fernando Rosa Velardo, David de Frutos-Escrig
TCS
2008
13 years 7 months ago
Reversible computing and cellular automata - A survey
Reversible computing is a paradigm where computing models are so defined that they reflect physical reversibility, one of the fundamental microscopic physical property of Nature. ...
Kenichi Morita
DAM
2002
125views more  DAM 2002»
13 years 7 months ago
Complexity of Langton's ant
The virtual ant introduced by Langton [Physica D 22 (1986) 120] has an interesting behavior, which has been studied in several contexts. Here we give a construction to calculate a...
Anahí Gajardo, Andrés Moreira, Eric ...
DNA
2007
Springer
176views Bioinformatics» more  DNA 2007»
14 years 1 months ago
Asynchronous Spiking Neural P Systems: Decidability and Undecidability
In search for “realistic” bio-inspired computing models, we consider asynchronous spiking neural P systems, in the hope to get a class of computing devices with decidable prope...
Matteo Cavaliere, Ömer Egecioglu, Oscar H. Ib...
HICSS
2003
IEEE
200views Biometrics» more  HICSS 2003»
14 years 20 days ago
A Dynamic Assignment Problem in a Mobile System with Limited Bandwidth
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
Yang Wang 0006, Thomas Kunz