✦ 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
DOI: 10.1016/s0304-3975(96)00088-6

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

A universal model for a family of doubly

A universal model for a family of doubly commuting operators

✍ A. Liazid 📂 Article 📅 1990 🏛 Springer US 🌐 English ⚖ 262 KB

Familial recurrence of geleophysic dyspl

Familial recurrence of geleophysic dysplasia

✍ Koiffmann, C. P. ;Wajntal, A. ;Ursich, M. J. M. ;Pupo, A. A. 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 235 KB 👁 2 views