๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A family of universal recurrent networks

โœ Scribed by Pascal Koiran


Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
512 KB
Volume
168
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

โœฆ Synopsis


Hava Siegelmann and Eduardo Sontag have shown that recurrent neural networks using the linear-bounded sigmoid are computationally universal. We show that this remains true if the linear-bounded sigmoid is replaced by any function in a fairly large class.


๐Ÿ“œ SIMILAR VOLUMES


Synthesis of universal networks
โœ A. M. Romankevich ๐Ÿ“‚ Article ๐Ÿ“… 1971 ๐Ÿ› Springer US ๐ŸŒ English โš– 177 KB
The family of universal axes
โœ Ja-Chen Lin ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 784 KB
Universal properties of growing networks
โœ P.L Krapivsky; B Derrida ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 250 KB

Networks growing according to the rule that every new node has a probability p k of being attached to k preexisting nodes, have a universal phase diagram and exhibit power-law decays of the distribution of cluster sizes in the non-percolating phase. The percolation transition is continuous but of in

Familial recurrence of achondroplasia
โœ Fitzsimmons, J. S. ;Opitz, John M. ;Reynolds, James F. ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 300 KB ๐Ÿ‘ 3 views
Familial recurrence of geleophysic dyspl
โœ Koiffmann, C. P. ;Wajntal, A. ;Ursich, M. J. M. ;Pupo, A. A. ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 235 KB ๐Ÿ‘ 2 views