On the Computational Complexity of Spiking Neural P Systems

DOI10.1007/978-3-540-85194-3_16MaRDI QIDQ3543343zbMATH OpenOpenAlexFDO

Authors Turlough Neary

Publication date 2 December 2008

Published in Unconventional Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-85194-3_16

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On the computational complexity of spiking neural P systems
• Polynomial complexity classes in spiking neural P systems
• Spiking neural P systems
• Three small universal spiking neural P systems
• Time features in the computational power of spiking neural P systems

Cites work

• Counter machines and counter languages
• Four Small Universal Turing Machines
• Membrane computing. An introduction.
• P-completeness of Cellular Automaton Rule 110
• Small Semi-weakly Universal Turing Machines
• Solving Numerical NP-Complete Problems with Spiking Neural P Systems
• Some applications of spiking neural P systems
• Spiking neural P systems

Cited in

(17)

• Uniform solutions to SAT and 3-SAT by spiking neural P systems with pre-computed resources
• Experiments on the reliability of stochastic spiking neural P systems
• On computing Boolean functions by a spiking neuron
• Novel systematic mathematical computation based on the spiking frequency gate (SFG): innovative organization of spiking computer
• Selected Topics in Computational Complexity of Membrane Systems
• Computing the Maximum Bisimulation with Spiking Neural P Systems
• Polynomial complexity classes in spiking neural P systems
• On the power of families of recognizer spiking neural P systems
• On the Computational Power of Threshold Circuits with Sparse Activity
• scientific article; zbMATH DE number 19763 (Why is no real title available?)
• Time features in the computational power of spiking neural P systems
• Three small universal spiking neural P systems
• Lower Bounds for the Computational Power of Networks of Spiking Neurons
• Spike-Based Winner-Take-All Computation: Fundamental Limits and Order-Optimal Circuits
• Some Open Problems about Catalytic, Numerical, and Spiking Neural P Systems
• On the computational complexity of spiking neural P systems
• On spiking neural P systems and partially blind counter machines

This page was built for publication: On the Computational Complexity of Spiking Neural P Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3543343)