No Polynomial Bound for the Period of Neuronal Automata with Inhibitory Memory.

We study the sequences generated by a neuronal equation with memory of the form x n 1[ k i1 a i x ni Θ], where k is the size of the memory. We show that in the case where all the parameters (a i) 1ik are negative real numbers, there exists a neuronal equation of memory length k that generates a sequence of period e (k log k) . This result shows that in the case where all weighting coefficients are negative, the neuronal recurrence equation exhibits a complex behavior.

FONDAP

CMM

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average

Found an issue? Give us feedback

0

Average

Green

Fields of Science

Fields of Science