Study On Computing Power Of Spiking Neural P Systems With Polarizations Under Sequential Rules

Membrane computing is an efficient computing model abstracted from the structure and function of living cells,in the course of more than 20 years of development,membrane computing has gradually been well known by scholars at home and abroad,among which membrane computing has been studied more the computing model is the spiking neural P systems(SN P systems for short),which are a kind of distributed parallel computing model,which is inspired by the mechanism of neurons in the biological nervous system transmitting pulses to exchange information through synapses.The spiking neural P systems with polarizations(PSN P systems for short),which is a variant of the SN P systems.Compared with the SN P systems,the PSN P systems use simpler formal language rules,and the behavior change of each neuron is determined by the number of spikes and the polarity state(positive charge,neutral charge,negative charge)are jointly controlled,and the rules are more freely applicable.This paper studies the computing power of the PSN P systems under the sequential rule,and investigates the Turing universality of the system in the generation mode and the acceptance mode respectively.The specific research contents and results are as follows:In the generation mode,the computing power of the PSN P systems is studied considering the sequentiality induced by the maximum number of spikes.In this sequential system,each step in the computation(except for neurons in the refractory period)preferentially fires neurons that are active.Two sequential strategies based on the maximum number of spikes are used,namely:(1)maximum sequential strategy---non-deterministically select an active neuron that satisfies the rules to fire first;(2)maximum pseudo-sequential strategy---satisfy the rules active neurons can fire simultaneously.By constructing the non-deterministic addition module,subtraction module and output module,and simulation register,it is proved that the PSN P systems adopting these two strategies have the equivalent computing power of the Turing machine in the generation mode.In the accepting mode,the sequential PSN P systems based on the minimum number of spikes is first studied.The computing results of this system still use the spike encoding rules defined by the SN P systems.By constructing the input module,deterministic addition module and subtraction module,the system was proven to be computationally universal when the simulation register was used as a digital receiving device.Then,the sequential PSN P systems based on the maximum number of spikes are considered,and the deterministic registration machine is simulated.It is proved that the systems also have the equivalent computing power to the Turing machine in the accepting mode.