Buscar
Mostrando ítems 1-10 de 78
Artículo
Proyecto europeo Siridus
(Sociedad Española para el Procesamiento del Lenguaje Natural (SEPLN), 2001)
Artículo
A uniform family of tissue P systems with cell division solving 3-COL in a linear time
(Elsevier, 2008)
Several examples of the efficiency of cell-like P systems regarding the solution of NPcomplete problems in polynomial time can be found in the literature(obviously, trading space for time). Recently, different new models ...
Artículo
Computational efficiency of dissolution rules in membrane systems
(Taylor and Francis, 2006)
Trading (in polynomial time) space for time in the framework of membrane systems is not sufficient to efficiently solve computationally hard problems. On the one hand, an exponential number of objects generated in ...
Artículo
Symport/Antiport P Systems with Three Objects Are Universal
(IOS Press, 2005)
The operations of symport and antiport, directly inspired from biology, are already known to be rather powerful when used in the framework of P systems. In this paper we confirm this observation with a quite surpris- ing ...
Artículo
Fragments of Arithmetic and true sentences
(Wiley, 2005)
By a theorem of R. Kaye, J. Paris and C. Dimitracopoulos, the class of the ¦n+1–sentences true in the standard model is the only (up to deductive equivalence) consistent ¦n+1–theory which extends the scheme of induction ...
Artículo
Reachability problems in low-dimensional iterative maps
(World Scientific, 2008)
In this paper we analyse the dynamics of one-dimensional piecewise maps (PAMs). We show that one-dimensional PAMs are equiv- alent to pseudo-billiard or so called \strange billiard" systems. We also show that the more ...
Artículo
Some Results on LΔ n+1
(Wiley, 2001)
We study the quantifier complexity and the relative strength of some fragments of arithmetic axiomatized by induction and minimization schemes for Δn+1 formulas.
Artículo
Spike Trains in Spiking Neural P Systems
(World Scientific, 2006)
We continue here the study of the recently introduced spiking neural P systems, which mimic the way that neurons communicate with each other by means of short electrical impulses, identical in shape (volt- age), but ...
Artículo
A Framework for Complexity Classes in Membrane Computing
(Elsevier, 2009)
The purpose of the present work is to give a general idea about the existing results and open problems concerning the study of complexity classes within the membrane computing framework. To this aim, membrane systems ...
Artículo
First Steps Towards a CPU Made of Spiking Neural P Systems
(Agora University of Oradea, Romania, 2009)
We consider spiking neural P systems as devices which can be used to perform some basic arithmetic operations, namely addition, subtraction, comparison and multiplica- tion by a fixed factor. The input to these systems ...