We consider spiking neural P systems with spiking rules allowed to introduce zero, one, or more spikes at the same time. The computing power of the obtained systems is investigated, when considering them as number ...

We continue the study of spiking neural P systems by considering these computing devices as binary string generators: the set of spike trains of halting computations of a given system constitutes the language generated ...

In the literature, several examples of the efficiency of cell-like P systems in order to solve NP-complete problems in polynomial time can be found. Recently, various new models of tissue-like P systems have received ...

It is known that the satisfiability problem (SAT) can be solved a semi- uniform family of deterministic polarizationless P systems with active membranes with non-elementary membrane division. We present a double improvement ...

We consider tissue-like P systems with states associated with the links (we call them synapses) between cells, controlling the passage of objects across the links. We investigate the computing power of such devices for ...

The evolution of a P system generates a tree of computation po- tentially in¯nite where it is very difficult to set the degree of closeness between two configurations. The problem is specially hard if we want to quantify ...

Current parallel simulation algorithms for Spiking Neural P (SNP) systems are based on a matrix representation. This helps to harness the inherent parallelism in algebraic operations, such as vector-matrix multiplication. ...

Membrane computing is a computing paradigm providing a class of distributed parallel computing devices of a biochemical type whose process units represent biological membranes. In the cell-like basic model, a hierarchical ...

We examine, from the point of view of membrane computing, the two basic assumptions of reaction systems, the "threshold" and "no permanence" ones. In certain circumstances (e.g., defining the successful computations by ...

Prime factorization is useful and crucial for public-key cryptography, and its application in public-key cryptography is possible only because prime factorization has been presumed to be difficult. A polynomial-time ...