Buscar
Mostrando ítems 1-8 de 8
Artículo
Recognizer P Systems with Antimatter
(Romanian Academy, Section for Information Science and Technology, 2015)
In this paper, we consider recognizer P systems with antimatter and the in uence of the matter/antimatter annihilation rules having weak priority over all the other rules or not. We rst provide a uniform family of ...
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 ...
Ponencia
Performing Arithmetic Operations with Spiking Neural P Systems
(Fénix Editora, 2009)
We consider spiking neural P systems as devices which can be used to perform some basic arithmetic operations, namely addition, subtraction, comparison and multiplication by a fixed factor. The input to these systems are ...
Ponencia
On The Semantics of Annihilation Rules in Membrane Computing
(Fénix Editora, 2015)
It is well known that polarizationless recognizer P systems with active membranes, without dissolution, with division of elementary and non-elementary membranes, with antimatter and matter/antimatter annihilation rules ...
Ponencia
Solving Numerical NP-complete Problems by Spiking Neural P Systems with Pre–computed Resources
(Fénix Editora, 2008)
Recently we have considered the possibility of using spiking neural P systems for solving computationally hard problems, under the assumption that some (possibly exponentially large) pre-computed resources are given in ...
Artículo
Solving SUBSET SUM by Spiking Neural P Systems with Pre-computed Resources
(IOS Press, 2008)
Recently the possibility of using spiking neural P systems for solving computationally hard problems has been considered. Such solutions assume that some (possibly exponentially large) pre-computed resources are given in ...
Artículo
P systems with input in binary form
(WORLD SCIENTIFIC PUBL CO PTE LTD, 2006)
Current P systems which solve NP-complete numerical problems represent the instances of the problems in unary notation. However, in classical complexity theory, based upon Turing machines, switching from binary to unary ...
Ponencia
Converting Integer Numbers from Binary to Unary Notation with P Systems
(Fénix Editora, 2005)
Current P systems which solve NP–complete numerical problems represent instances in unary notation. In classical complexity theory, based upon Turing machines, switching from binary to unary encoded instances gen erally ...