On the computational complexity of spiking neural P systems
From MaRDI portal
Publication:609034
DOI10.1007/s11047-010-9213-1zbMath1207.68141arXiv0912.0928MaRDI QIDQ609034
Publication date: 30 November 2010
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0912.0928
computational complexity; linear time; spiking neural P system; small universal spiking neural P system; time efficient spiking neural P system
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
Related Items
Universality of SNQ P Systems Using One Type of Spikes and Restrictive Rule Application, Three small universal spiking neural P systems, Small SNQ P systems with multiple types of spikes, On solutions and representations of spiking neural P systems with rules on synapses, Sequentiality Induced by Spike Number in SNP Systems: Small Universal Machines, Universality of Graph-controlled Leftist Insertion-deletion Systems with Two States, Universal Sleptsov net
Cites Work