The expressive power of analog recurrent neural networks on infinite input streams

DOI10.1016/J.TCS.2012.01.042zbMATH Open1253.68202OpenAlexW2033372923MaRDI QIDQ428898FDOQ428898

Authors: Jérémie Cabessa, Alessandro E. P. Villa 

Publication date: 25 June 2012

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.01.042

Recommendations

• Computational capabilities of analog and evolving neural networks over infinite input streams
• Expressive power of evolving neural networks working on infinite input streams
• Expressive power of non-deterministic evolving recurrent neural networks in terms of their attractor dynamics
• Expressive power of first-order recurrent neural networks determined by their attractor dynamics
• Analog neuron hierarchy

zbMATH Keywords

topologyanalog computationTuring machinesanalytic setsBorel sets\(\omega \)-automataanalog neural networks

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Set Theory
• A logical calculus of the ideas immanent in nervous activity
• Automata, logics, and infinite games. A guide to current research
• Title not available (Why is that?)
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Title not available (Why is that?)
• On the computational power of neural nets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Borel ranks and Wadge degrees of context free $\omega$-languages
• Title not available (Why is that?)
• Analog computation via neural networks
• Title not available (Why is that?)
• The dynamic universality of sigmoidal neural networks
• How We Think of Computing Today
• Title not available (Why is that?)
• Automata Studies. (AM-34)
• Turing computability with neural nets
• \(X\)-automata on \(\omega\)-words
• A hierarchical classification of first-order recurrent neural networks
• Title not available (Why is that?)
• Computational power of neural networks: a characterization in terms of Kolmogorov complexity
• Title not available (Why is that?)
• Interactive Computation

Cited In (12)

• Analog neuron hierarchy
• A Survey on Analog Models of Computation
• A new design formula exploited for accelerating Zhang neural network and its application to time-varying matrix inversion
• Expressive power of first-order recurrent neural networks determined by their attractor dynamics
• A hierarchical classification of first-order recurrent neural networks
• Expressive power of non-deterministic evolving recurrent neural networks in terms of their attractor dynamics
• Expressive power of evolving neural networks working on infinite input streams
• Discrete-time formulation, control, solution and verification of pendulum systems with zeroing neural dynamics
• From mathematical equivalence such as Ma equivalence to generalized Zhang equivalency including gradient equivalency
• Computational capabilities of analog and evolving neural networks over infinite input streams
• Automata complete computation with Hodgkin-Huxley neural networks composed of synfire rings
• Subrecursive neural networks

This page was built for publication: The expressive power of analog recurrent neural networks on infinite input streams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q428898)