(1+1) genetic programming with functionally complete instruction sets can evolve Boolean conjunctions and disjunctions with arbitrarily small error (Q6161501)

From MaRDI portal
Revision as of 19:01, 30 December 2024 by Import241228121245 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7702948
Language Label Description Also known as
English
(1+1) genetic programming with functionally complete instruction sets can evolve Boolean conjunctions and disjunctions with arbitrarily small error
scientific article; zbMATH DE number 7702948

    Statements

    (1+1) genetic programming with functionally complete instruction sets can evolve Boolean conjunctions and disjunctions with arbitrarily small error (English)
    0 references
    0 references
    0 references
    0 references
    27 June 2023
    0 references
    genetic programming
    0 references
    computational complexity
    0 references
    theory
    0 references

    Identifiers