Sciweavers

242 search results - page 43 / 49
» Zigzags in Turing Machines
Sort
View
ESCIENCE
2006
IEEE
13 years 11 months ago
Designing Workflow Components for e-Science
In this paper we present a general domain for the analysis of workflows and workflow components based on the notion of a collection of Turing machines sharing a set of tapes. We s...
Frank Terpstra, Pieter W. Adriaans
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
CJ
2006
100views more  CJ 2006»
13 years 7 months ago
Fuzzifying P Systems
Abstract. Uncertainty is an inherent property of all living systems. Curiously enough, computational models inspired by biological systems do not take, in general, under considerat...
Apostolos Syropoulos
AI
1998
Springer
13 years 7 months ago
What Robots Can Do: Robot Programs and Effective Achievability
In this paper, we propose a definition of goal achievability: given a basic action theory describing an initial state of the world and some primitive actions available to a robot...
Fangzhen Lin, Hector J. Levesque
JUCS
2002
80views more  JUCS 2002»
13 years 7 months ago
On the Power of P Systems with Symport Rules
: A purely communicative variant of P systems was considered recently, based on the trans-membrane transport of couples of chemicals. When using both symport rules (the chemicals p...
Carlos Martín-Vide, Andrei Paun, Gheorghe P...