Cited by 297Neural Networks and ApplicationsControl Systems and IdentificationMachine Learning and ELM

Recurrent Neural Networks Are Universal Approximators

Schäfer, Anton Maximilian, Zimmermann, Hans Georg·2006·Lecture Notes in Computer Science

Integrity signals

Registry

Crossref · 10.1007/11840817_66

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

  • A deep neural network can be replaced with a single-layer neural network because both can approximate any given function.

    “or replacing a deep neural network with a single-layer neural network, since both types of networks can approximate any given function (Hornik et al. 1989; Schäfer and Zimmermann 2006).”

    From Falsification and consciousness (2021) · cites this paper as Schäfer and Zimmermann 2006

Cited by

Sorted by citations

Authors
Schäfer, A. M., & Zimmermann, H. G.
Affiliations
Siemens (Germany) (DE)
Venue
Lecture Notes in Computer Science
Published
2006
Pages
632-640
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
OpenAlex
W1604264128
Cited by
297
References
0
Citations by year
2026: 11 · 2025: 23 · 2024: 34 · 2023: 39 · 2022: 31 · 2021: 59 · 2020: 21 · 2019: 19 · 2018: 8 · 2017: 8 · 2016: 4 · 2015: 2 · 2014: 4 · 2013: 2 · 2012: 10
FWCI
2.88
Type
conference paper
Language
en
Open access
closed
Locations
Lecture notes in computer science (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Neural Networks and Applications
  • Physical Sciences › Engineering › Control and Systems Engineering › Control Systems and Identification
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and ELM
Keywords
recurrent neural networks, universal approximation, state-space model, open dynamical systems, feedforward neural networks, function approximation, Borel measurable functions

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