2010
DOI: 10.1007/978-3-642-11467-0_24
View full text
|
|
Share

Abstract: Summary. Inspired by the growth of dendritic trees in biological neurons, we introduce spiking neural P systems with budding rules. By applying these rules in a maximally parallel way, a spiking neural P system can exponentially increase the size of its synapse graph in a polynomial number of computation steps. Such a possibility can be exploited to efficiently solve computationally difficult problems in deterministic polynomial time, as it is shown in this paper for the NP-complete decision problem sat.

Search citation statements

Order By: Relevance

Citation Types

0
2
0

Paper Sections

0
0
0
0
0

Publication Types

0
0
0
0

Relationship

0
0

Authors

Journals