A family of universal recurrent networks

DOI10.1016/S0304-3975(96)00088-6zbMath0874.68250MaRDI QIDQ1349875

Pascal Koiran

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (8)

General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results ⋮ Subrecursive neural networks ⋮ Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines ⋮ Three analog neurons are Turing universal ⋮ Analog neuron hierarchy ⋮ A survey of computational complexity results in systems and control ⋮ Computability with polynomial differential equations ⋮ Deciding stability and mortality of piecewise affine dynamical systems

Cites Work

• Turing computability with neural nets
• Analog computation via neural networks
• On the computational power of neural nets
• Unnamed Item

This page was built for publication: A family of universal recurrent networks