Abstract
It is shown that there is no standard spiking neural P system that simulates Turing machines with less than exponential time and space overheads. The spiking neural P systems considered here have a constant number of neurons that is independent of the input length. Following this we construct a universal spiking neural P system with exhaustive use of rules that simulates Turing machines in polynomial time and has only 18 neurons.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chen, H., Ionescu, M., Ishdorj, T.: On the efficiency of spiking neural P systems. In: Gutiérrez-Naranjo, M.A., et al. (eds.) Proceedings of Fourth Brainstorming Week on Membrane Computing, Sevilla, February 2006, pp. 195–206 (2006)
Fischer, P.C., Meyer, A., Rosenberg, A.: Counter machines and counter languages. Mathematical Systems Theory 2(3), 265–283 (1968)
Ionescu, M., Păun, G., Yokomori, T.: Spiking neural P systems. Fundamenta Informaticae 71(2-3), 279–308 (2006)
Ionescu, M., Păun, G., Yokomori, T.: Spiking neural P systems with exhaustive use of rules. International Journal of Unconventional Computing 3(2), 135–153 (2007)
Ionescu, M., Sburlan, D.: Some applications of spiking neural P systems. In: Eleftherakis, G., et al. (eds.) Proceedings of the Eighth Workshop on Membrane Computing, Thessaloniki, June 2007, pp. 383–394 (2007)
Leporati, A., Zandron, C., Ferretti, C., Mauri, G.: On the computational power of spiking neural P systems. In: Gutiérrez-Naranjo, M.A., et al. (eds.) Proceedings of the Fifth Brainstorming Week on Membrane Computing, Sevilla, January 2007, pp. 227–245 (2007)
Leporati, A., Zandron, C., Ferretti, C., Mauri, G.: Solving numerical NP-complete problems with spiking neural P systems. In: Eleftherakis, G., et al. (eds.) Proceedings of the Eighth Workshop on Membrane Computing, Thessaloniki, June 2007, pp. 405–423 (2007)
Neary, T., Woods, D.: P-completeness of cellular automaton Rule 110. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 132–143. Springer, Heidelberg (2006)
Neary, T., Woods, D.: Four small universal Turing machines. In: Durand-Lose, J., Margenstern, M. (eds.) MCU 2007. LNCS, vol. 4664, pp. 242–254. Springer, Heidelberg (2007)
Neary, T., Woods, D.: Small weakly universal Turing machines. Technical Report arXiv:0707.4489v1, arXiv online report (July 2007)
Păun, A., Păun, G.: Small universal spiking neural P systems. BioSystems 90(1), 48–60 (2007)
Păun, G.: Membrane Computing: An Introduction. Springer, Heidelberg (2002)
Woods, D., Neary, T.: On the time complexity of 2-tag systems and small universal Turing machines. In: 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), Berkeley, California, October 2006, pp. 439–448. IEEE, Los Alamitos (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Neary, T. (2008). On the Computational Complexity of Spiking Neural P Systems. In: Calude, C.S., Costa, J.F., Freund, R., Oswald, M., Rozenberg, G. (eds) Unconventional Computing. UC 2008. Lecture Notes in Computer Science, vol 5204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85194-3_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-85194-3_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85193-6
Online ISBN: 978-3-540-85194-3
eBook Packages: Computer ScienceComputer Science (R0)