Turing computability with neural nets

DOI10.1016/0893-9659(91)90080-FzbMATH Open0749.68032WikidataQ56058050 ScholiaQ56058050MaRDI QIDQ1190653FDOQ1190653

Authors: Hava T. Siegelmann, Eduardo D. Sontag 

Publication date: 26 September 1992

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 953043
• scientific article; zbMATH DE number 2070737
• scientific article; zbMATH DE number 1260390
• scientific article; zbMATH DE number 1909824
• Neural networks and complexity theory
• General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results
• scientific article; zbMATH DE number 1784855
• Neural networks for NP-complete problems
• scientific article; zbMATH DE number 4059180
• Computing with neuron nets (review)

zbMATH Keywords

neural networkTuring machine

Mathematics Subject Classification ID

Cites Work

• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Efficient simulation of finite automata by neural nets

Cited In (41)

• Recurrent neural networks for dynamical systems: applications to ordinary differential equations, collective motion, and hydrological modeling
• Welcoming the super Turing theories
• What NARX networks can compute
• An RNA-based theory of natural universal computation
• Noise-robust realization of Turing-complete cellular automata by using neural networks with pattern representation
• Transiently chaotic neural networks with piecewise linear output functions
• Frontier between decidability and undecidability: A survey
• A learning result for continuous-time recurrent neural networks
• On connectionist models
• Title not available (Why is that?)
• Training Recurrent Networks by Evolino
• Title not available (Why is that?)
• A survey of computational complexity results in systems and control
• 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
• On the computational power of probabilistic and faulty neural networks
• A Solution Method for Truncated Normalized Max Product Fuzzy Set of Equations
• Title not available (Why is that?)
• Optimal simulation of automata by neural nets
• Stochastic analog networks and computational complexity
• Echo state networks with filter neurons and a delay\&sum readout
• Chaos in computer performance
• Title not available (Why is that?)
• Analysis and Design of Echo State Networks
• The simple dynamics of super Turing theories
• A Nonautonomous Equation Discovery Method for Time Signal Classification
• ON COMPUTATION OVER CHAOS USING NEURAL NETWORKS: APPLICATION TO BLIND SEARCH AND RANDOM NUMBER GENERATION
• The Turing Machine Constructed by Trainable Threshold Elements
• Learning finite state models from recurrent neural networks
• On the computational power of neural nets
• Echo state queueing networks: a combination of reservoir computing and random neural networks
• Title not available (Why is that?)
• Universal neural field computation
• A family of universal recurrent networks
• Three analog neurons are Turing universal
• Computability with low-dimensional dynamical systems
• Universal computation and other capabilities of hybrid and continuous dynamical systems
• Echo state network activation function based on bistable stochastic resonance
• Efficient simulation of finite automata by neural nets
• Piecewise integrable neural network: an interpretable chaos identification framework
• A neural compiler

This page was built for publication: Turing computability with neural nets

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