Spiking neural P systems with neuron division and budding

Abstract

Summary. In order to enhance the efficiency of spiking neural P systems, we introduce the features of neuron division and neuron budding, which are processes inspired by neural stem cell division. As expected (as it is the case for P systems with active membranes), in this way we get the possibility to solve computationally hard problems in polynomial time. We illustrate this possibility with SAT problem.

Solving Subset Sum Problems by Time-free Spiking Neural P Systems

“…SN P systems were proved to be computationally complete, i.e., Turing universal, as number generators [5,11,12,13,14,15], language generators [3,21], and function computing devices [16]. SN P systems with cell division or budding can generate new neurons during the computation, thus provide a way to generate exponential working space in polynomial or linear time.…”

“…SN P systems with cell division or budding can generate new neurons during the computation, thus provide a way to generate exponential working space in polynomial or linear time. These systems were successfully used to (theoretically) solve computationally hard problems, particular in NP-hard problems, in a feasible (polynomial or linear) time (see, e.g., [6,7,8,12]). …”

“…In the previous obtained SN P systems in [3,5,6,7,8,12,16,20], a global clock is generally assumed marking the time for the system. The systems work in a synchronized manner in the global level (all neurons apply their rules in a parallel manner), and for each neuron, only one of the enabled rules can be used on the tick of the clock.…”

Solving Vertex Cover Problem by Tissue P Systems with Cell Division

“…Many variants of all the three classes of P systems, as well as their computational properties have been considered [1,3,4,5,6,7,8,15,16,17,18,19]; an overview of membrane computing or P systems can be found in [10] and [12], with up-to-date information available at the membrane computing website (http://ppage.psystems.eu).…”

Parallel Solution to the Dominating Set Problem by Tile Assembly System

“…In recent years, computing devices inspired by cells (or molecules inside cells such as DNA) are deeply investigated. Most of such computing systems inspired by cells, tissues and neural networks are theoretically proved to be universal [12,13,14] and computationally efficient [15,16,20,21,22,23,24,25,26,27,28,29,30]. This work focuses on computing systems based DNA tile assembly which is a prospective method to overcome the ultimate limits of silicon-based technology.…”