2010
DOI: 10.1007/978-3-642-11467-0_24
View full text |Buy / Rent full text
|
Sign up to set email alerts
|

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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 7 publications
(2 reference statements)
0
2
0
Order By: Relevance
“…(3) Until now the models used in the fault diagnosis method have static network structures. It can be further investigated whether it is possible to construct fault diagnosis methods using the SNPS models with dynamic network structure, such as SNPS with structural plasticity [14] and SNPS with neuron budding rules [55] or SNPS with neuron division and budding rule [56,57], etc., which can increase the size of the synapse graph. Furthermore, we can compare the performance of these models with the existing models with static network.…”
Section: Remarkmentioning
confidence: 99%
See 1 more Smart Citation
“…(3) Until now the models used in the fault diagnosis method have static network structures. It can be further investigated whether it is possible to construct fault diagnosis methods using the SNPS models with dynamic network structure, such as SNPS with structural plasticity [14] and SNPS with neuron budding rules [55] or SNPS with neuron division and budding rule [56,57], etc., which can increase the size of the synapse graph. Furthermore, we can compare the performance of these models with the existing models with static network.…”
Section: Remarkmentioning
confidence: 99%
“…These rules of the SNPS systems also play an important role in solving computationally hard problem. The SNPS systems with budding rules [55], SNPS with neuron division and budding rules [56,57] and SNPS with structural plasticity [58] are examples of such models. By applying the budding rules in a maximal parallel manner, in polynomial time an SNPS is capable of increasing the size of its synapse graph.…”
Section: Solving Computationally Hard Problemsmentioning
confidence: 99%