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.
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
Cited by
Some Philosophical Problems from the Standpoint of Artificial Intelligence
McCarthy, J., & Hayes, P. J. (1981) · Readings in Artificial Intelligence · doi:10.1016/b978-0-934613-03-3.50033-7 · Cited by 3,279
PERSPECTIVE: COMPLEX ADAPTATIONS AND THE EVOLUTION OF EVOLVABILITY
Wagner, G. P., & Altenberg, L. (1996) · Evolution · doi:10.1111/j.1558-5646.1996.tb02339.x · Cited by 1,914
Licklider, J. C. R. (1960) · IRE Transactions on Human Factors in Electronics · doi:10.1109/thfe2.1960.4503259 · Cited by 1,938
Steps toward Artificial Intelligence
Minsky, M. (1961) · Proceedings of the IRE · doi:10.1109/jrproc.1961.287775 · Cited by 1,675
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
Global Optimization Methods in Geophysical Inversion
Sen, M. K., & Stoffa, P. L. (2013) · Cambridge University Press eBooks · doi:10.1017/cbo9780511997570 · Cited by 990
Speculations Concerning the First Ultraintelligent Machine
Good, I. J. (1966) · Advances in Computers · doi:10.1016/s0065-2458(08)60418-0 · Cited by 703
Computational Intelligence: An Introduction
Fulcher, J. (2008) · Studies in Computational Intelligence · doi:10.1007/978-3-540-78293-3_1 · Cited by 629
A review of particle swarm optimization. Part I: background and development
Banks, A., Vincent, J., & Anyakoha, C. (2007) · Natural Computing · doi:10.1007/s11047-007-9049-5 · Cited by 626
A comparison of linear genetic programming and neural networks in medical data mining
Brameier, M., & Banzhaf, W. (2001) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.910462 · Cited by 505
Types of machine learning algorithms
Oladipupo, T. (2010) · New Advances in Machine Learning · doi:10.5772/9385 · Cited by 443
Assessment of artificial neural network and genetic programming as predictive tools
Gandomi, A. H., & Roke, D. A. (2015) · Advances in Engineering Software · doi:10.1016/j.advengsoft.2015.05.007 · Cited by 406
The Perceptron: A Model for Brain Functioning. I
Block, H. D. (1962) · Reviews of Modern Physics · doi:10.1103/revmodphys.34.123 · Cited by 396
Generality in artificial intelligence
McCarthy, J. (1987) · Communications of the ACM · doi:10.1145/33447.33448 · Cited by 391
An Overview of Machine Learning
Carbonell, J. G., Michalski, R. S., & Mitchell, T. M. (1983) · Machine Learning · doi:10.1007/978-3-662-12405-5_1 · Cited by 381
Fundamentals of natural computing: an overview
DECASTRO, L. (2007) · Physics of Life Reviews · doi:10.1016/j.plrev.2006.10.002 · Cited by 297
Quantum-inspired evolutionary algorithms: a survey and empirical study
Zhang, G. (2011) · Journal of Heuristics · doi:10.1007/s10732-010-9136-0 · Cited by 295
Metaheuristic Algorithms in Modeling and Optimization
Gandomi, A. H., Yang, X.-S., Talatahari, S., & Alavi, A. H. (2013) · Metaheuristic Applications in Structures and Infrastructures · doi:10.1016/b978-0-12-398364-0.00001-2 · Cited by 268
A robust data mining approach for formulation of geotechnical engineering systems
Hossein Alavi, A., & Hossein Gandomi, A. (2011) · Engineering Computations · doi:10.1108/02644401111118132 · Cited by 266
AN OVERVIEW OF MACHINE LEARNING
Carbonell, J. G., Michalski, R. S., & Mitchell, T. M. (1983) · Machine Learning · doi:10.1016/b978-0-08-051054-5.50005-4 · Cited by 259
Open issues in genetic programming
O’Neill, M., Vanneschi, L., Gustafson, S., & Banzhaf, W. (2010) · Genetic Programming and Evolvable Machines · doi:10.1007/s10710-010-9113-2 · Cited by 224
On the Measure of Intelligence
Chollet, F. (2019) · arXiv · doi:10.48550/arxiv.1911.01547 · Cited by 218
Generality in artificial intelligence
McCarthy, J. (2007) · ACM Turing award lectures · doi:10.1145/1283920.1283926 · Cited by 107
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
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.