PÉREZ JIMÉNEZ , Mario De Jesús

Formal verification of molecular programs is a first step towards their automatic processing by means of reasoning systems (ACL2, PVS, etc). In this paper a systematic method to establish verifications of these programs within molecular models with memory, that is, molecular computing models where some operations modifying the inner structure...

Cellular signalling pathways are fundamental to the control and regulation of cell behaviour. Understanding the biosignalling network functions are crucial for studying di erent diseases and for designing e ective therapeutic approaches to them. In this paper we present P systems as a feasible computational modelling tool for cellular...

No description

In this paper, a computational complexity theory within the framework of Membrane Computing is introduced. Polynomial complexity classes associated with di erent models of cell-like and tissue-like membrane systems are de ned and the most relevant results obtained so far are presented. Many attractive characterizations of P 6= NP conjecture...

: The P ?=NP question is one of the outstanding open problems in theoretical computer science. The relevance of this question is not only the inherent pleasure of solving a mathematical problem, since an answer to it would provide information of high economical interest. On the one hand, a negative answer to this question would confirm that the...

The use of models is intrinsic to any scientific activity. In particular, formal/mathematical models provide a relevant tool for scientific investigation. This paper presents a new Membrane Computing based computational paradigm as a framework for modelling processes and real-life phenomena. P systems, devices in Membrane Computing, are not...

El objetivo fundamental de esta memoria es el estudio de unos nuevos esquemas de axiomas, que denominaremos esquemas del máximo, desde los siguientes puntos de vista:1. Relacio nes con los esquemas clásicos de inducción, minimización, colección y colección fuerte, para los conjuntos de fórmulas n y n (capítulo 2).2. Aplicaciones de los esquemas...

In this paper we present a theory of computational complexity in the framework of membrane computing. Polynomial complexity classes in recognizer membrane systems and capturing the classical deterministic and non-deterministic modes of computation, are introduced. In this context, a characterization of the relation P = NP is described.

In this work we revisit the basic concepts, definitions of computational complexity theory in membrane computing. The paper also discusses a novel methodology to tackle the P versus NP problem in the context of the aforementioned theory. The methodology is illustrated with a collection of frontiers of tractability for several classes of P systems.

In the present work we obtain several representations of the rank func- tion associated to a well founded relation in terms of transitive and supertransitive closures, by means of transfinite recursion theorems con- cerning these relations and with no use of ordinals theory • Moreover, specificai representations are obtained for the ordinary...