Claim and evidence Close ×
According to Koza (1990), John Holland presented a mathematical formulation of simulated evolution ("genetic algorithms") for fixed-length character strings in Adaptation in Natural and Artificial Systems (1975). Copy claim link
Copy claim reference
Machine-checked, not reviewed by an editor Stated in source Supported
Supporting evidence: primary · 1 source
Date 1990-06 · publication Records dated 1990 → Kind of attribution Attributes a term or concept to the work Scope and limits Attributed statement; "pioneering" is Koza's word. Koza contrasts Holland's crossover-based approach with mutation-only work such as Fogel et al. (1966); neither is recorded as earliest. Holland's book was not retrieved.
The evidence 02 primary source Supports the claim
Genetic Programming: A Paradigm for Genetically Breeding Populations of Computer Programs to Solve Problems ↗ Stanford University Computer Science Department (report STAN-CS-90-1314, as hosted on genetic-programming.com) · 1990-06
Copy source reference
Cite the original source Cite the original document, not Selekoa. Check these details against it.
Copy APA
Download BibTeX Download RIS Download CSL-JSON
Source excerpt “Professor John Holland of the University of Michigan presented the pioneering mathematical formulation of simulated evolution” Location in source PDF p. 10, section "Background on genetic algorithms"
How it was read Retrieved directly from the publisher
Machine-checked · 2026-10-31
Source details and check notes Authors John R. Koza Version Retrieved for the candidate pack on 2026-10-29 (SHA-256 ada3dfc040fb1341dfce6dfaf10938f7f1e9855f45e75331f2fa71e4b1592474). Report PDF hosted on the author's site; text layer with some mis-encoded quotation marks. Canonical address Open the canonical source ↗ Accessed 2026-10-29 Language English (en) Attribution John R. Koza, “Genetic Programming: A Paradigm for Genetically Breeding Populations of Computer Programs to Solve Problems”, 1990-06. Reuse No open redistribution licence asserted. Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution. Check notes Candidate pack passage, Kinds of AI and technical history (research/technical-history). The quotation (16 words) matched the text retrieved for the candidate pack on 2026-10-29. Matching ignored differences of whitespace, case, quotation marks, dashes, PDF line-break hyphens and Unicode compatibility forms, so the source’s typography can differ. The source role is primary for this record: the passage is the citing text’s own attribution, which is what the record states (corrected at admission; the pack had secondary, relative to the work credited). A cross-family machine check (31 October 2026, item 80) re-read the record’s sources and found that they support what the record states. No human editorial review. primary source Supports the claim
Genetic Programming: A Paradigm for Genetically Breeding Populations of Computer Programs to Solve Problems ↗ Stanford University Computer Science Department (report STAN-CS-90-1314, as hosted on genetic-programming.com) · 1990-06
Copy source reference
Cite the original source Cite the original document, not Selekoa. Check these details against it.
Copy APA
Download BibTeX Download RIS Download CSL-JSON
Source excerpt “for fixed-length (typically binary) character strings in Adaptation in Natural and Artificial Systems (Holland 1975)” Location in source PDF p. 10, same paragraph
How it was read Retrieved directly from the publisher
Machine-checked · 2026-10-31
Source details and check notes Authors John R. Koza Version Retrieved for the candidate pack on 2026-10-29 (SHA-256 ada3dfc040fb1341dfce6dfaf10938f7f1e9855f45e75331f2fa71e4b1592474). Report PDF hosted on the author's site; text layer with some mis-encoded quotation marks. Canonical address Open the canonical source ↗ Accessed 2026-10-29 Language English (en) Attribution John R. Koza, “Genetic Programming: A Paradigm for Genetically Breeding Populations of Computer Programs to Solve Problems”, 1990-06. Reuse No open redistribution licence asserted. Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution. Check notes Candidate pack passage, Kinds of AI and technical history (research/technical-history). The quotation (15 words) matched the text retrieved for the candidate pack on 2026-10-29. Matching ignored differences of whitespace, case, quotation marks, dashes, PDF line-break hyphens and Unicode compatibility forms, so the source’s typography can differ. The source role is primary for this record: the passage is the citing text’s own attribution, which is what the record states (corrected at admission; the pack had secondary, relative to the work credited). A cross-family machine check (31 October 2026, item 80) re-read the record’s sources and found that they support what the record states. No human editorial review. Status and meaning Editorial status. Not reviewed by an editor . An exploratory record that no editor has accepted. This status does not say whether a person has read any linked passage. Each evidence record above shows how it was checked.
Relation. A document expressly attributes an argument, concept, term, finding or approach to another work, in its own words; the kind of attribution is recorded. The record is the citing document’s claim. It is not evidence that the cited work originated the idea, that the attribution is accurate, or of influence beyond the passage. Citation alone is recorded as a citation.
Date. Date of publication, as the source gives it.
Record ID th-evo-koza-credits-holland