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
Induction: Processes Of Inference
Holland, J. H., Holyoak, K. J., Nisbett, R. E., & Thagard, P. (1986) · The MIT Press eBooks · doi:10.7551/mitpress/3729.001.0001 · Cited by 1,534 · cited 2×
“Default hierarchies are considered desirable in induction problems (Holland, 1986, Holland et al., 1986, Wilson, 1988) because they are often parsimonious and they are a human-like way of dealing with situations.”
BackgroundSome studies in machine learning using the game of checkers
Samuel, A. L. (2000) · IBM Journal of Research and Development · doi:10.1147/rd.441.0206 · Cited by 1,439
Proceedings of the third international conference on Genetic algorithms
Schaffer, J. D. (1989) · international conference on Genetic algorithms · Cited by 1,280
Messy genetic algorithms: motivation, analysis, and first results
Goldberg, D. E., Korb, B., & Deb, K. (1989) · Complex Systems · Cited by 1,127
Proceedings of the fourth international conference on Genetic algorithms
Belew, R. K., & Booker, L. B. (1991) · Cited by 822
Koza, J. R. (1990) · Cited by 721
Self-citationA Representation for the Adaptive Generation of Simple Sequential Programs
Cramer, N. L. (1985) · international conference on Genetic algorithms · Cited by 641
Automatic programming of behavior-based robots using reinforcement learning
Mahadevan, S., & Connell, J. (1992) · Artificial Intelligence · doi:10.1016/0004-3702(92)90058-6 · Cited by 591
A learning system based on genetic adaptive algorithms
Smith, S. F. (1980) · Medical Entomology and Zoology · Cited by 591
The truck backer-upper: an example of self-learning in neural networks
Nguyen, & Widrow (1989) · International Joint Conference on Neural Networks · doi:10.1109/ijcnn.1989.118723 · Cited by 449
Learning to Tell Two Spirals Apart
Lang, K. J., & Witbrock, M. J. (1988) · doi:10.13140/2.1.3459.2329 · Cited by 421
Holland, J. H. (1986) · American Association for Artificial Intelligence eBooks · Cited by 407
Classifier systems and the animat problem
Wilson, S. W. (1987) · Machine Learning · doi:10.1007/bf00058679 · Cited by 285
Genetic generation of both the weights and architecture for a neural network
Koza, J. R., & Rice, J. P. (2002) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.1991.155366 · Cited by 282
Self-citationForrest, S. (1991) · Cited by 235
A Distributed Model for Mobile Robot Environment-Learning and Navigation
Matarić, M. J. (1990) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 195
Genetic Algorithms and Robotics
Davidor, Y. (1991) · World Scientific series in robotics and intelligent systems · doi:10.1142/1111 · Cited by 168
The Truck Backer-Upper: An Example of Self-Learning in Neural Networks
Nguyen, D., & Widrow, B. C. (1990) · Elsevier eBooks · doi:10.1016/b978-0-444-88400-8.50006-6 · Cited by 153
Genetic synthesis of Boolean neural networks with a cell rewriting developmental process
Gruau, F. (2003) · doi:10.1109/cogann.1992.273948 · Cited by 111 · cited 1×
“The recent work of Gruau (1992) on recursive solutions to Boolean functions is a notable exception.”
BackgroundAutomatic programming of robots using genetic programming
Koza, J. R., & Rice, J. P. (1992) · Cited by 90
Self-citationUsing the genetic algorithm to generate LISP source code to solve the prisoner's dilemma
Fujiko, C., & Dickinson, J. (1987) · international conference on Genetic algorithms · Cited by 82
M2 per unit of potential GNP as an anchor for the price levelPreprint
Hallman, J. J., Porter, R. D., & Small, D. H. (1989) · RePEc: Research Papers in Economics · Cited by 55
Hierarchical credit allocation in a classifier system
Wilson, S. W. (1987) · International Joint Conference on Artificial Intelligence · Cited by 46
Hierarchical Automatic Function Definition in Genetic Programming
Koza, J. R. (1993) · Foundations of genetic algorithms · doi:10.1016/b978-0-08-094832-4.50024-6 · Cited by 45
Self-citationGenetic breeding of non-linear optimal control strategies for broom balancing
Koza, J. R., & Keane, M. A. (1990) · Lecture notes in control and information sciences · doi:10.1007/bfb0120027 · Cited by 34
Self-citationBid competition and specificity reconsidered
Wilson, S. W. (1988) · Complex Systems · Cited by 31
Koza, J. R., Keane, M. A., & Rice, J. P. (2002) · IEEE International Conference on Neural Networks/IEEE ... International Conference on Neural Networks · doi:10.1109/icnn.1993.298555 · Cited by 28
Self-citationA one neuron truck backer-upper
Geva, S., Sitte, J., & Willshire, G. (2003) · 2022 International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.1992.226881 · Cited by 11 · cited 2×
“Each program is tested against a simulated environment consisting of eight fitness cases, each consisting of a set of initial”
BackgroundMethod
Cited by
Machine Learning in Predictive Maintenance towards Sustainable Smart Manufacturing in Industry 4.0
Çınar, Z. M., Abdussalam Nuhu, A., Zeeshan, Q., Korhan, O., Asmael, M., & Safaei, B. (2020) · Sustainability · doi:10.3390/su12198211 · Cited by 834
“Syntax trees are developed using the stochastic genetic programming technique from the field of evolutionary algorithms [74].”
MethodCrested Porcupine Optimizer: A new nature-inspired metaheuristic
Abdel-Basset, M., Mohamed, R., & Abouhawwash, M. (2024) · Knowledge-Based Systems · doi:10.1016/j.knosys.2023.111257 · Cited by 617
What do we need to build explainable AI systems for the medical domain?
Holzinger, A., Biemann, C., Pattichis, C. S., & Kell, D. B. (2017) · arXiv · doi:10.48550/arxiv.1712.09923 · Cited by 636
“Very useful for building explainable systems in the medical domain is generally ge-netic programming (Koza, 1994; Pena-Reyes and Sipper, 1999; Tsakonas et al., 2004), and specifically evolutionary algorithms (Wang and Palade, 2011; Holzinger et al., 2014, 2016).”
BackgroundMathematical discoveries from program search with large language models
Romera-Paredes, B., Barekatain, M., Novikov, A., Balog, M., Kumar, M. P., Dupont, E., Ruiz, F. J. R., Ellenberg, J. S., Wang, P., Fawzi, O., et al. (2024) · Nature · doi:10.1038/s41586-023-06924-6 · Cited by 544
“To surpass the ‘nominal’ capabilities of LLMs, recent studies 3 have combined them with evolutionary algorithms 14,15 , leading to important improvements on diverse synthetic problems 16 , searching for neural network architectures 17–19 and solving puzzles 20 .”
BackgroundMethodMohamed, A. W., Hadi, A. A., & Mohamed, A. K. (2020) · International Journal of Machine Learning and Cybernetics · doi:10.1007/s13042-019-01053-x · Cited by 501
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.