GUTIÉRREZ NARANJO , Miguel Ángel

It is well-known the huge Mario's contribution to the development of Membrane Computing. Many researchers may relate his name to the theory of complexity classes in P systems, the research of frontiers of the tractability or the application of Membrane Computing to model real-life situations as the Quorum Sensing System in Vibrio fischeri or...

"En esta memoria hemos estudiado los procesos de generalización, el paso de lo particular a lo general, cuando la información está expresada en lenguaje clausal. Para ello hemos definido unos operadores adaptados a los distintos órdenes de generalidad. Ha sido necesar ... io compaginar adecuadamente los distintos niveles en los que se produce...

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 are natural numbers expressed in binary form, encoded as appropriate sequences of spikes. A single system accepts as inputs...

This short note proposes some ideas for considering evolutionary game theory in the area of membrane computing

The aim of this paper is to start an investigation and a comparison of the expressiveness of the two most relevant formalisms inspired by membranes interactions, namely, P systems and Brane Calculi. We compare the two formalisms w.r.t. their ability to act as language generators. In particular, we show different ways of generating the set L =...

No description

In Membrane Computing, the solution of a decision problem X belonging to the complexity class P via a polynomially uniform family of recognizer P systems is trivial, since the polynomial encoding of the input can involve the solution of the problem. The design of such solution has one membrane, two objects, two rules and one computation step....

The process of designing a P system in order to perform a task is a hard job. The researcher has often only an approximate idea of the design, but finding the exact description of the rules is a heavy hand-made work. In this paper we introduce PSystemEvolver, an evolutionary algorithm based on generative encoding, that could help to design a P...

In Membrane Computing, the solution of a decision problem X belonging to the complexity class P via a polynomially uniform family of recognizer P systems is trivial, since the polynomial encoding of the input can involve the solution of the problem. The design of such solution has one membrane, two objects, two rules and one computation...

No description

Membrane Computing and Brane Calculi are two recent computational paradigms in the framework of Natural Computing. They are based on the study of the structure and functioning of living cells as living organisms able to process and generate information. In this paper we give a short introduction to both areas and point out some open research lines.

In computational processes based on backwards chaining, a rule of the type A Ã B1; : : : ;Bn is seen as a procedure which points that the problem A can be split into the problems B1; : : : ;Bn. In classical devices, the subproblems B1; : : : ;Bn are solved sequentially. In this paper we present some questions that circulated during the Second...

The use of negative information provides a new tool for exploring the limits of P systems as computational devices. In this paper we prove that the combination of antimatter and annihilation rules (based on the annihilation of physical particles and antiparticles) and membrane creation (based on autopoiesis) provides a P system model able to...

The aim of this paper is to start an investigation and a comparison of the expressiveness of the two most relevant formalisms inspired by membranes interactions, namely, P systems and Brane Calculi. We compare the two formalisms with respect to their ability to act as generator devices. In particular, we show different ways of generating the...

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 advance. In this paper we continue this research line, and we investigate the possibility of solving numerical...

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 natural numbers expressed in binary form, encoded as appropriate sequences of spikes. A single system accepts as inputs...

Pole balancing is a control benchmark widely used in engineering. It involves a pole a xed to a cart via a joint which allows movement along a single axis. In this problem, the movement of the cart is restricted to the horizontal axis by a track and the pole is free to move about the horizontal axis of the pivot. The system is...