The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Neural networks for computation: number representations and programming complexity
Abstract
Methods for using neural networks for computation are considered. The success of such networks in finding good solutions to complex problems is found to be dependent on the number representation schemes used. Redundant schemes are found to offer advantages in terms of convergence. Neural networks are applied to the combinatorial optimization problem known as the Hitchcock problem and signal processing problems, such as matrix inversion and Fourier transformation. The concept of programming complexity is introduced. It is shown that for some computational problems, the programming complexity may be so great as to limit the utility of neural networks, while for others the investment of computation in programming the network is justified. Simulations of neural networks using a digital computer are presented.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Neural networks and physical systems with emergent collective computational abilities.
Hopfield, J. J. (1982) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.79.8.2554 · Cited by 19,270
Hopfield, J. J. (1984) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.81.10.3088 · Cited by 6,918
Associatron-A Model of Associative Memory
Nakano, K. (1972) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1972.4309133 · Cited by 369
Cited by
Neural algorithm for solving differential equations
Lee, H., & Kang, I. S. (1990) · Journal of Computational Physics · doi:10.1016/0021-9991(90)90007-n · Cited by 436
Image restoration using a neural network
Zhou, Y.-T., Chellappa, R., Vaid, A., & Jenkins, B. K. (1988) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/29.1641 · Cited by 412
Neural networks for shortest path computation and routing in computer networks
Ali, M. K. M., & Kamoun, F. (1993) · IEEE Transactions on Neural Networks · doi:10.1109/72.286889 · Cited by 272
The numerical solution of linear ordinary differential equations by feedforward neural networks
Meade, A. J., & Fernandez, A. A. (1994) · Mathematical and Computer Modelling · doi:10.1016/0895-7177(94)90095-7 · Cited by 256
Metadata
- Authors
- Takeda, M., & Goodman, J. W.
- Venue
- Applied Optics
- Publisher
- Optica Publishing Group
- Published
- 1986-09-15
- Volume
- 25
- Issue
- 18
- Pages
- 3033
- ISSN
- 0003-6935 (ISSN-L)
- 1539-4522
- OpenAlex
- W2167257108
- Cited by
- 213
- References
- 3
- FWCI
- 8.66
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.