Hava (Eve) Tova Siegelmann  Home/Search
Context Related
| rutgers.edu/pub/techn...dcstr306.ps.Z cs.cuhk.hk/pub/neuro/...dcstr306.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: rutgers.edu/pub/technicalrepo... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: OF THE DISSERTATION Foundations of Recurrent Neural Networks by Hava (Eve) Tova Siegelmann, Ph.D. Dissertation Director: Professor Eduardo D. Sontag "Artificial neural networks" provide an appealing model of computation. Such networks consist of an interconnection of a number of parallel agents, or "neurons." Each of these receives certain signals as inputs, computes some simple function, and produces a signal as output, which is in turn broadcast to the successive neurons involved in a given... (Update)
Context of citations to this paper: More
...neural networks. It has been shown theoretically that recurrent networks are computationally as powerful as Turing machines (Siegelmann, 1993). However, the class of problems that recurrent networks can learn, and the solutions that the networks find are still not...
.... that require to learn the rules of regular languages (RLs) describable by deterministic nite state automata (DFA) Casey, 1996; Siegelmann, 1993; Blair and Pollack, 1997; Kalinke and Lehmann, 1998; Zeng et al. 1994) Until now, however, it has remained unclear whether LSTM...
Cited by: More
Conclusion - Vi Summary As (Correct)
Methodological Issues in Simulating the Emergence of Language - Tonkes, Wiles (2000) (Correct)
Long Short-Term Memory Learns Context Free and Context.. - Gers, Schmidhuber (2001) (Correct)
Similar documents (at the sentence level):
13.5%: Analog Computation Via Neural Networks - Siegelmann, Sontag (1994) (Correct)
11.5%: Neural Networks with Real Weights: Analog Computational.. - Siegelmann, Sontag (1992) (Correct)
7.7%: On The Computational Power Of Neural Nets - Siegelmann, Sontag (1991) (Correct)
Active bibliography (related documents): More All
0.8: Some Topics in Neural Networks and Control - Sontag (1993) (Correct)
0.5: Computational Complexity Of Neural Networks: A Survey - Orponen (1995) (Correct)
0.5: On the Power of Democratic Networks - Eddy Mayoraz (1996) (Correct)
Similar documents based on text: More All
0.3: On the Relations Between Dynamical Systems and Boolean Circuits - Koiran (1993) (Correct)
0.2: References In A Memory Hierarc - Vidyadhar Phalke Graduate (Correct)
0.2: Turing Universality of Neural Nets (Revisited) - Neto, Siegelmann, Costa, Araujo (Correct)
Related documents from co-citation: More All
3: Finding structure in time - Elman - 1990
2: Learning to count without a counter: A case study of dynamics and activation lan.. - Wiles, Elman - 1995
2: The Dynamics of Discrete-Time Computation (context) - Casey - 1996
BibTeX entry: (Update)
Siegelmann, H. T. (1993). Foundations of Recurrent Neural Networks. PhD thesis, New Brunswick Rutgers, The State of New Jersey. http://citeseer.ist.psu.edu/173827.html More
@misc{ siegelmann93foundations,
author = "H. Siegelmann",
title = "Foundations of Recurrent Neural Networks",
text = "Siegelmann, H. T. (1993). Foundations of Recurrent Neural Networks. PhD
thesis, New Brunswick Rutgers, The State of New Jersey.",
year = "1993",
url = "citeseer.ist.psu.edu/173827.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
644 Finding structure in time - Elman - 1990
357 Approximation by superpositions of a sigmoidal function (context) - Cybenko - 1989
291 A logical calculus of the ideas immanent in nervous activity (context) - McCulloch, Pitts - 1943
269 A learning algorithm for continually running fully recurrent.. - Williams, Zipser - 1989
268 Parallel algorithms for shared-memory machines (context) - Karp, Ramachandran - 1990
268 Neurons with graded responses have collective computational .. (context) - Hopfield - 1984
235 the approximate realization of continuous mappings by neural.. (context) - Franklin - 1989
227 An introduction to computing with neural nets (context) - Lippmann - 1987
221 Perceptrons: An Introduction to Computational Geometry (context) - Minsky, Papert - 1988
213 a theory of computation and complexity over the real numbers.. (context) - Blum, Shub et al. - 1989
203 What size net gives valid generalization (context) - Baum, Haussler - 1989
192 Representation of events in nerve nets and finite automata (context) - Kleene - 1956
177 Computation: Finite and Infinite Machines (context) - Minsky - 1967
174 Principles of Neurodynamics (context) - Rosenblatt - 1962
145 Learning and extracting finite state automata with second-or.. (context) - Giles, Miller et al. - 1992
120 An Introduction to Numerical Analysis (context) - Atkinson - 1989
115 Separating the polynomial-time hierarchy by oracles (context) - Yao - 1985
114 Mathematical Control Theory: Deterministic Finite Dimensiona.. (context) - Sontag - 1990
107 Rational Series and their Languages (context) - Berstel, Reutenauer - 1988
105 the computational power of neural nets - Siegelmann, Sontag - 1992
104 Automata-Theoretic Aspects of Formal Power Series (context) - Salomaa, Soittola - 1978
102 Training a 3-node neural network is np-complete - Blum, Rivest - 1990
101 Threshold Logic and its Applications (context) - Muroga - 1971
91 Approximation capabilities of multilayer feedforward network.. (context) - Hornik - 1991
90 Neural Network Design and the Complexity of Learning (context) - Judd - 1990
85 Turing machines that take advice (context) - Karp, Lipton - 1982
84 The Emperor's New Mind (context) - Penrose - 1989
73 Temporal proof methodologies for real-time systems - Henziger, Manna et al. - 1992
71 Multilayer feedforward networks with a non-polynomial activa.. (context) - Leshno, Lin et al. - 1993
64 Feedforward nets for interpolation and classification (context) - Sontag - 1992
62 Universal approximation of an unknown mapping and its deriva.. (context) - Hornik, Stinchcombe et al. - 1990
61 Analog computation via neural networks - Siegelmann, Sontag - 1993
61 Analog computation via neural networks - Siegelmann, Sontag
44 Bounds for the computational power and learning complexity o.. - Maass - 1993
38 Uniqueness of the weights for minimal feedforward nets with .. - Sussmann - 1992
37 Efficient simulation of finite automata by neural nets (context) - Alon, Dewdney et al. - 1991
36 the computational power of sigmoid versus boolean threshold .. (context) - Maass, Schnitger et al. - 1991
36 Turing computability with neural nets - Siegelmann, Sontag - 1991
32 Machine models and simulations (context) - Boas - 1990
30 Dynamic construction of finite-state automata from examples .. (context) - Tomita - 1982
27 Finiteness results for sigmoidal `neural' networks - Macintyre, Sontag - 1993
25 The Complexity of Computing (context) - Savage - 1976
25 On Connectionist Models of Natural Language Processing (context) - Pollack - 1987
23 The power of approximating: a comparison of activation funct.. - DasGupta, Schnitger - 1992
23 Feedback stabilization using two-hidden-layer nets - Sontag - 1992
22 Neural net approximation (context) - Barron - 1992
22 Uniqueness of weights for neural networks - Albertini, Sontag et al. - 1993
22 Neural computability (context) - Franklin, Garzon - 1990
22 Neural computability (context) - Garzon, Franklin - 1989
17 The complexity of analog computation (context) - Vergis, Steiglitz et al. - 1986
17 A comparison of the computational power of neural network mo.. (context) - Hartley, Szu - 1987
17 Finite state automata and simple recurrent recurrent network.. (context) - Cleeremans, Servan-Schreiber et al. - 1989
17 Neural nets as systems models and controllers - Sontag - 1992
16 A characterization of the power of vector machines (context) - Pratt, Stockmeyer - 1976
16 Backpropagation separates where perceptrons do - Sontag, Sussmann - 1991
15 The complexity of language recognition by neural networks (context) - Siegelmann, Sontag et al. - 1992
14 Complexity in electronic switching circuits (context) - Muller - 1956
13 Construction of neural nets using the radon transform (context) - Carroll, Dickinson - 1989
13 Rate of approximation results motivated by robust neural net.. (context) - Darken, Donahue et al. - 1993
12 Recursive Function Theory and Logic (context) - Yasuhara - 1971
12 Identification and control of nonlinear systems using neural.. - Polycarpou, Ioannou - 1991
12 A multilayer neural network with piecewise-linear structure .. (context) - Batruni - 1991
11 Turing equivalence of neural networks with second order conn.. (context) - Sun, Chen et al. - 1991
11 A universal turing machine with two internal states (context) - Shannon - 1956
10 Continuous symbol systems: The logic of connectionism (context) - MacLennan - 1992
10 Approximating and learning unknown mappings using multilayer.. - Stinchcombe, White - 1990
9 Characterizations of logarithmic advice complexity classes (context) - Balc'azar, Hermo et al. - 1992
9 On Pure and Applied Mathematics (context) - Hong, models - 1988
9 Some structural complexity aspects of neural computation (context) - Balc'azar, Gavalda et al. - 1993
8 The Computational and Learning Complexity of Neural Networks (context) - Parberry - 1993
8 A computationally universal field computer which is purely l.. (context) - Wolpert - 1991
6 Controllability is harder to decide than accessibility (context) - Sontag - 1988
6 the power of sigmoid neural networks (context) - Kilian, Siegelmann - 1993
6 A neuromorphic vlsi learning system (context) - Alspector, Allen - 1987
5 Competitive neural architecture for hardware solution to the.. (context) - Eberhardt, Daud et al. - 1989
4 the uniform approximation of nonlinear discrete-time fading-.. (context) - Matthews - 1992
3 Articifial neural network on a simd architecture (context) - Brown, Garber et al. - 1988
3 Realization theory of discrete-time nonlinear systems: Part .. (context) - Sontag - 1979
3 Lectures on classical and probabilistic automata (context) - Rabin - 1966
2 Time concepts in real-time software (context) - Motus - 1993
2 Department of Computer Sciences (context) - Parberry, understanding et al. - 1992
1 Digital Equipment Cooperation USA (context) - Steeler, The - 1984
1 Technical Report Research Report C (context) - Kobayashi, of - 1981
1 Dept of Computer and Information Science (context) - Pollack, of et al. - 1990
1 Computational limitations for small depth circuits (context) - Hastard - 1987
1 On certain questions of rationality and decidability (context) - Sontag - 1975
1 Pascal Programming Structure: An Introduction To Systematic .. (context) - Cherry - 1980
1 Solving combinatorial optimization problems by gradient flow.. (context) - Wong - 1992
Documents on the same site (http://www.cs.rutgers.edu/pub/technical-reports/): More
Constrained REDO: An Alternative to REPLAY - Liew, Steinberg (1993) (Correct)
Jambalaya: Using Multicast for Blind Distributed Web Searching .. - Navas, Hirsh (1998) (Correct)
Law-Governed Regularities in Software Systems - Minsky (1994) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC