On the approximation capability of recurrent neural networks
The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“We examined Elman RNNs (‘vanilla’ RNNs), which are perhaps the simplest RNN architecture capable of theoretically representing any nonlinear dynamical system (Hammer, 2000)”
From Remapping in a recurrent neural network model of navigation and context inference (2023) · cites this paper as Hammer, 2000
Citations
Cites
Hochreiter, S., & Schmidhuber, J. (1997) · Neural Computation · doi:10.1162/neco.1997.9.8.1735 · Cited by 102,318
Multilayer feedforward networks are universal approximators
Hornik, K., Stinchcombe, M., & White, H. (1989) · Neural Networks · doi:10.1016/0893-6080(89)90020-8 · Cited by 21,728
Multilayer feedforward networks are universal approximators
HornikK., StinchcombeM., & WhiteH. (1989) · Neural Networks · doi:10.5555/70405.70408 · Cited by 9,081
Identification and control of dynamical systems using neural networks
Narendra, K. S., & Parthasarathy, K. (1990) · IEEE Transactions on Neural Networks · doi:10.1109/72.80202 · Cited by 8,014
A Learning Algorithm for Continually Running Fully Recurrent Neural Networks
Williams, R. J., & Zipser, D. (1989) · Neural Computation · doi:10.1162/neco.1989.1.2.270 · Cited by 4,369
Distributed representations, simple recurrent networks, and grammatical structure
Elman, J. L. (1991) · Machine Learning · doi:10.1007/bf00114844 · Cited by 1,354
Hinton, G. E. (2018) · KiltHub Repository · doi:10.1184/r1/6604925 · Cited by 1,025
On the Computational Power of Neural Nets
Siegelmann, H. T., & Sontag, E. D. (1995) · Journal of Computer and System Sciences · doi:10.1006/jcss.1995.1013 · Cited by 692
Learning task-dependent distributed representations by backpropagation through structure
Goller, C., & Kuchler, A. (2002) · Proceedings of International Conference on Neural Networks (ICNN'96) · doi:10.1109/icnn.1996.548916 · Cited by 581
Some new results on neural network approximation
Hornik, K. (1993) · Neural Networks · doi:10.1016/s0893-6080(09)80018-x · Cited by 496
Research works printed but not linked: 2
- M. Mozer, Neural net architectures for temporal sequence processing, in: A. Weigend, N. Gershenfeld (Eds.), Predicting the Future and Understanding the Past, Addison-Wesley, Reading, MA, 1993.
- S. Schulz, A. Küchler, C. Goller, Some experiments on the applicability of folding architectures to guide theorem proving, in: D.D. Dankel (Ed.), Proceedings of the 10th International FLAIRS Conference, AI Research Society, Florida, 1997, pp. 377–381.
Cited by
Supervised Sequence Labelling with Recurrent Neural Networks
Graves, A. (2012) · Studies in Computational Intelligence · doi:10.1007/978-3-642-24797-2 · Cited by 3,120
Deep Learning-Based Vehicle Behavior Prediction for Autonomous Driving Applications: A Review
Mozaffari, S., Al-Jarrah, O. Y., Dianati, M., Jennings, P., & Mouzakitis, A. (2022) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2020.3012034 · Cited by 671
Recurrent Neural Networks Are Universal Approximators
Schäfer, A. M., & Zimmermann, H. G. (2006) · Lecture Notes in Computer Science · doi:10.1007/11840817_66 · Cited by 297
DiPietro, R., & Hager, G. D. (2020) · Handbook of Medical Image Computing and Computer Assisted Intervention · doi:10.1016/b978-0-12-816176-0.00026-0 · Cited by 293
Temporal Models for Predicting Student Dropout in Massive Open Online Courses
Fei, M., & Yeung, D.-Y. (2015) · 2015 IEEE International Conference on Data Mining Workshop (ICDMW) · doi:10.1109/icdmw.2015.174 · Cited by 276
Metadata
- Authors
- Hammer, B.
- Affiliations
- Osnabrück University (DE)
- Corresponding author
- Hammer, Barbara
- ORCID
- Hammer, Barbara
- Venue
- Neurocomputing
- Publisher
- Elsevier BV
- Published
- 2000-03
- Volume
- 31
- Issue
- 1-4
- Pages
- 107-123
- ISSN
- 0925-2312 (ISSN-L)
- OpenAlex
- W1496343492
- Cited by
- 132
- References
- 21
- Citations by year
- 2026: 4 · 2025: 10 · 2024: 12 · 2023: 15 · 2022: 11 · 2021: 10 · 2020: 10 · 2019: 14 · 2018: 5 · 2017: 8 · 2016: 4 · 2015: 6 · 2014: 3 · 2013: 1 · 2012: 2
- FWCI
- 1.25
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.elsevier.com/tdm/userlicense/1.0/ (tdm)
- Locations
- Neurocomputing (publishedVersion)
- PUB – Publications at Bielefeld University (Bielefeld University) (submittedVersion)
- Publikationen an der Universität Bielefeld (Universität Bielefeld) (submittedVersion)
- Natural Computing
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Neural Networks and Applications
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Computability, Logic, AI Algorithms
- Physical Sciences › Computer Science › Computational Theory and Mathematics › semigroups and automata theory
- Keywords
- recurrent neural networks, function approximation, approximation capability, symbolic data, L-infinity norm
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On the approximation capability of recurrent neural networks. https://app.cochat.ai/papers/10.1016/s0925-2312(99)00174-5
- The paper
- Hammer, B. (2000). On the approximation capability of recurrent neural networks. Neurocomputing. https://doi.org/10.1016/s0925-2312(99)00174-5
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.