On the computational complexity of spiking neural P systems-Reference-Cited by-同舟云学术

On the computational complexity of spiking neural P systems

Published:2010-08-11 Issue:4 Volume:9 Page:831-851
ISSN:1567-7818
Container-title:Natural Computing
language:en
Short-container-title:Nat Comput

Author:

Neary Turlough

Publisher

Springer Science and Business Media LLC

Subject

Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/s11047-010-9213-1.pdf

Reference19 articles.

1. Chen H, Ionescu M, Ishdorj T (2006) On the efficiency of spiking neural P systems. In: Gutiérrez-Naranjo MA, Păun G, Riscos-Núñez A, Romero-Campero FJ (eds) Proceedings of fourth brainstorming week on membrane computing, Sevilla, Spain, Feb 2006, pp 195–206

2. Fischer PC, Meyer A, Rosenberg A (1968) Counter machines and counter languages. Math Syst Theory 2(3):265–283

3. Ionescu M, Sburlan D (2007) Some applications of spiking neural P systems. In: Eleftherakis G, Kefalas P, Păun G (eds) Proceedings of the eighth workshop on membrane computing, Thessaloniki, Greece, June 2007, pp 383–394

4. Ionescu M, Păun G, Yokomori T (2006) Spiking neural P systems. Fundamenta Informaticae 71(2–3):279–308

5. Ionescu M, Păun G, Yokomori T (2007) Spiking neural P systems with exhaustive use of rules. Int J Unconv Comput 3(2):135–153

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Strong Sleptsov nets are Turing complete;Information Sciences;2023-04

2. Deep learning on Sleptsov nets;International Journal of Parallel, Emergent and Distributed Systems;2021-06-27

3. Small SNQ P Systems with multiple types of spikes;Theoretical Computer Science;2021-03

4. Universality of SNQ P Systems Using One Type of Spikes and Restrictive Rule Application;International Journal of Foundations of Computer Science;2020-01

5. On solutions and representations of spiking neural P systems with rules on synapses;Information Sciences;2019-10