The DOI matches its Crossref record.
A Learning Machine: Part I
Abstract
Machines would be more useful if they could learn to perform tasks for which they were not given precise methods. Difficulties that attend giving a machine this ability are discussed. It is proposed that the program of a stored-program computer be gradually improved by a learning procedure which tries many programs and chooses, from the instructions that may occupy a given location, the one most often associated with a successful result. An experimental test of this principle is described in detail. Preliminary results, which show limited success, are reported and interpreted. Further results and conclusions will appear in the second part of the paper.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cited by
Licklider, J. C. R. (1960) · IRE Transactions on Human Factors in Electronics · doi:10.1109/thfe2.1960.4503259 · Cited by 1,938
Evolutionary computation: Comments on the history and current state
Back, T., Hammel, U., & Schwefel, H.-P. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585888 · Cited by 1,536
Speculations Concerning the First Ultraintelligent Machine
Good, I. J. (1966) · Advances in Computers · doi:10.1016/s0065-2458(08)60418-0 · Cited by 703
Types of machine learning algorithms
Oladipupo, T. (2010) · New Advances in Machine Learning · doi:10.5772/9385 · Cited by 443
Generality in artificial intelligence
McCarthy, J. (1987) · Communications of the ACM · doi:10.1145/33447.33448 · Cited by 391
Metadata
- Authors
- Friedberg, R. M.
- Venue
- IBM Journal of Research and Development
- Publisher
- IBM
- Published
- 1958-01
- Volume
- 2
- Issue
- 1
- Pages
- 2-13
- ISSN
- 0018-8646 (ISSN-L)
- OpenAlex
- W1970001627
- Cited by
- 373
- References
- 0
- FWCI
- 18.90
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Learning Machine: Part I. https://app.cochat.ai/papers/10.1147/rd.21.0002
- The paper
- Friedberg, R. M. (1958). A Learning Machine: Part I. IBM Journal of Research and Development. https://doi.org/10.1147/rd.21.0002
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.
