Weighted Spiking Neural P Systems with Rules on Synapses

Spiking neural P systems (SN P systems, for short) with rules on synapses are a new variant of SN P systems, where the spiking and forgetting rules are placed on synapses instead of in neurons. Recent studies illustrated that this variant of SN P systems is universal working in the way that the synapses starting from the same neuron work in parallel (i.e., all synapses starting from the same neuron should apply their rules if they have rules to be applied). In this work, we consider SN P systems with rules on synapses working in another way: the synapses starting from the same neuron are restricted to work in a sequential way (i.e., at each step at most one synapse starting from the same neuron applies its rule). It is proved that the computational power of SN P systems with rules on synapses working in this way is reduced; specifically, they can only generate finite sets of numbers. Such SN P systems with rules on synapses are proved to be universal, if synapses are allowed to have weight at most 2 (if a rule which can generate n spikes is applied on a synapse with weight k, then the neuron linking to this synapse will receive totally nk spikes). Two small universal SN P systems with rules on synapses for computing functions are also constructed: a universal system with 26 neurons when using extended rules and each synapse having weight at most 2, and a universal system with 26 neurons when using standard rules and each synapse having weight at most 12. These results illustrate that the weight is an important feature for the computational power of SN P systems.

[1]  Oscar H. Ibarra,et al.  On spiking neural P systems , 2006, Natural Computing.

[2]  Ivan Korec,et al.  Small Universal Register Machines , 1996, Theor. Comput. Sci..

[3]  Xiangxiang Zeng,et al.  Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources , 2010, Theor. Comput. Sci..

[4]  Gheorghe Paun,et al.  Spiking Neural P Systems with Anti-Spikes , 2009, Int. J. Comput. Commun. Control.

[5]  Giancarlo Mauri,et al.  Uniform solutions to SAT and Subset Sum by spiking neural P systems , 2008, Natural Computing.

[6]  Gheorghe Paun,et al.  The Oxford Handbook of Membrane Computing , 2010 .

[7]  Linqiang Pan,et al.  Spiking Neural P Systems With Rules on Synapses Working in Maximum Spiking Strategy , 2014, IEEE Transactions on NanoBioscience.

[8]  Andrei Paun,et al.  Small universal spiking neural P systems , 2007, Biosyst..

[9]  Xiangxiang Zeng,et al.  A Note on Small Universal Spiking Neural P Systems , 2009, Workshop on Membrane Computing.

[10]  Xiangxiang Zeng,et al.  On string languages generated by spiking neural P systems with exhaustive use of rules , 2008, Natural Computing.

[11]  Gheorghe Păun,et al.  Spiking Neural P Systems with Weights , 2010, Neural Computation.

[12]  Linqiang Pan,et al.  Spiking Neural P Systems with Astrocytes , 2012, Neural Computation.

[13]  Pan Linqiang,et al.  Spiking neural P systems with neuron division and budding , 2011 .

[14]  Grzegorz Rozenberg,et al.  Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

[15]  Grzegorz Rozenberg,et al.  Handbook of formal languages, vol. 1: word, language, grammar , 1997 .

[16]  Gheorghe Paun Spiking Neural P Systems with Astrocyte-Like Control , 2007, J. Univers. Comput. Sci..

[17]  Xiangxiang Zeng,et al.  Smaller Universal Spiking Neural P Systems , 2008, Fundam. Informaticae.

[18]  Rudolf Freund,et al.  On String Languages Generated by Spiking Neural P Systems , 2007, Fundam. Informaticae.

[19]  Oscar H. Ibarra,et al.  Asynchronous spiking neural P systems , 2009, Theor. Comput. Sci..

[20]  Linqiang Pan,et al.  Asynchronous spiking neural P systems with local synchronization , 2013, Inf. Sci..