Genetic programming as a means for programming computers by natural selection
The DOI matches its Crossref record; 38 of the 38 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
“Indeed, genetic programming methods require defining several parameters, chief among them the set of allowed mutation operations (or primitives)15.”
From Mathematical discoveries from program search with large language models (2024) · cites this paper as [15]
Citations
Cites
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002 · cited 2×
“John Holland's pioneering book Adaptation in Natural and Artificial Systems described how the evolutionary process in nature can be applied to artificial systems using the genetic algorithm operating on fixed-length character strings ( Holland, 1975 ).”
BackgroundMethodGenetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
Genetic Programming: On the Programming of Computers by Means of Natural Selection
Koza, J. R. (1992) · Medical Entomology and Zoology · Cited by 13,082
Self-citationGenetic Algorithms + Data Structures = Evolution Programs
Michalewicz, Z. (1992) · Artificial Intelligence · doi:10.1007/978-3-662-02830-8 · Cited by 11,553
Goldberg, D. E. (1989) · Medical Entomology and Zoology · Cited by 10,109
A robust layered control system for a mobile robot
Brooks, R. (1986) · IEEE Journal on Robotics and Automation · doi:10.1109/jra.1986.1087032 · Cited by 7,799
Handbook of Genetic Algorithms
Davis, L. D. (1991) · Cumulative Index of Computer Aided Architectural Design · Cited by 7,330
Some Studies in Machine Learning Using the Game of Checkers
Samuel, A. L. (1959) · IBM Journal of Research and Development · doi:10.1147/rd.33.0210 · Cited by 4,443
Induction: Processes of Inference, Learning, and Discovery
Holland, J. H., Holyoak, K. J., Nisbett, R. E., Thagard, P. R., & Smoliar, S. W. (1987) · IEEE Expert · doi:10.1109/mex.1987.4307100 · Cited by 2,305
Genetic Algorithms and Simulated Annealing
Davis, L. D. (1987) · Cited by 1,759
Cited by
Items 1,001–1,003 of 1,003
Scratch-induced damage of doped DLC and MoS 2 coatings—Deep symbolic analysis
Liu, M., Xu, Z., Yuktanan, N., Gu, T., Zhang, G., Jiang, J., Yang, F., & Liang, R. (2025) · Friction · doi:10.26599/frict.2025.9441166 · Cited by 3
ESHO: improved seahorse optimization using restart and adaptive mutation strategies
Che, Y., Wang, J., Hussien, A. G., Wang, S., & Zheng, R. (2025) · Cluster Computing · doi:10.1007/s10586-025-05367-0 · Cited by 4
“In evolutionary-based algorithms,Genetic algorithm(GA) is regarded as the most popular method [23].”
Prediction of Rotary Drilling Rate of Penetration in Surface Mines Using Machine Learning Techniques
Nabavi, Z., Hosseini, S., Hamidi, J. K., Monjezi, M., Hasheminasab, F., Vardin, A. N., & Hasanipanah, M. (2025) · Rock Mechanics and Rock Engineering · doi:10.1007/s00603-025-05014-5 · Cited by 3
Metadata
- Authors
- Koza, J.
- Affiliations
- Stanford University (US)
- Corresponding author
- Koza, JohnR.
- Venue
- Statistics and Computing
- Published
- 1994-06
- Volume
- 4
- Issue
- 2
- ISSN
- 0960-3174 (ISSN-L)
- 1573-1375
- OpenAlex
- W2040492000
- Cited by
- 1,685
- References
- 38
- Citations by year
- 2026: 189 · 2025: 245 · 2024: 268 · 2023: 212 · 2022: 149 · 2021: 110 · 2020: 117 · 2019: 115 · 2018: 84 · 2017: 24 · 2016: 20 · 2015: 22 · 2014: 27 · 2013: 33 · 2012: 8
- FWCI
- 2.48
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Statistics and Computing (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Evolutionary Algorithms and Applications
- Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
- Physical Sciences › Computer Science › Computer Science Applications › Teaching and Learning Programming
- Keywords
- genetic programming, program synthesis, Darwinian selection, genetic crossover, symbolic regression, machine learning
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.