Turing computability with neural nets
From MaRDI portal
Publication:1190653
DOI10.1016/0893-9659(91)90080-FzbMath0749.68032WikidataQ56058050 ScholiaQ56058050MaRDI QIDQ1190653
Hava T. Siegelmann, Eduardo D. Sontag
Publication date: 26 September 1992
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Related Items
Computability with low-dimensional dynamical systems, The simple dynamics of super Turing theories, A family of universal recurrent networks, Learning finite state models from recurrent neural networks, Echo state network activation function based on bistable stochastic resonance, An RNA-based theory of natural universal computation, Design of continuous-time recurrent neural networks with piecewise-linear activation function for generation of prescribed sequences of bipolar vectors, The expressive power of analog recurrent neural networks on infinite input streams, Chaos in computer performance, A Solution Method for Truncated Normalized Max Product Fuzzy Set of Equations, On the computational power of probabilistic and faulty neural networks, A neural compiler, Universal computation and other capabilities of hybrid and continuous dynamical systems, A survey of computational complexity results in systems and control, Training Recurrent Networks by Evolino, Transiently chaotic neural networks with piecewise linear output functions, Analysis and Design of Echo State Networks, Echo state networks with filter neurons and a delay\&sum readout, ECHO STATE QUEUEING NETWORKS: A COMBINATION OF RESERVOIR COMPUTING AND RANDOM NEURAL NETWORKS, A learning result for continuous-time recurrent neural networks, ON COMPUTATION OVER CHAOS USING NEURAL NETWORKS: APPLICATION TO BLIND SEARCH AND RANDOM NUMBER GENERATION, Frontier between decidability and undecidability: A survey, Stochastic analog networks and computational complexity, A Nonautonomous Equation Discovery Method for Time Signal Classification
Cites Work
