Local Homogeneous Weighted Spiking Neural P Systems
Homogeneous Spiking Neural P Systems (HSN P systems, for short) are a class of neural-like computing models in membrane computing, which are inspired by neurons that they are “designed” by nature to have the same “set of rules”, “working” in a uniform way to transform input into output. HSN P systems can be converted to weighted homogeneous SNP systems. In this work, based on the above two known systems, we consider a restricted variant of SN P systems called local homogeneous weighted SN P systems (LHWSN P systems, for short), where neurons in same module have the same set of rules. As a result, we prove that such systems can achieve Turing completeness. Specifically, it is proved that using only standard spiking rules is sufficient to compute and accept the family of sets of Turing computable natural numbers, moreover local homogeneity reduces the time required for the execution of the system.
KeywordsSpiking Neural P system Weight Local homogeneous
This work was supported by the Natural Science Foundation of China (No. 61502283). Natural Science Foundation of China (No. 61472231). Natural Science Foundation of China (No. 61640201).
- 3.Ionescu, M., Păun, G., Yokomori, T.: Spiking neural P systems. Fund. Inf. 71(2–3), 279–308 (2006)Google Scholar
- 5.Ibarra, O.H., Păun, A., Rodríguez-Patón, A.: Sequential SNP systems based on min/max spike number. Theor. Comput. Sci. 410(s30–s32), 2982–2991 (2009)Google Scholar
- 18.Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to automata theory, languages, and computation, 2nd edn. ACM Sigact News 5(8), 60–65 (2001)Google Scholar
- 20.Leporati, A., Zandron, C., Ferretti, C., et al.: On the computational power of spiking neural P systems. Int. J. Unconventional Comput. 5(5), 459–473 (2009)Google Scholar