(1+1) genetic programming with functionally complete instruction sets can evolve Boolean conjunctions and disjunctions with arbitrarily small error (Q6161501): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.artint.2023.103906 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.ARTINT.2023.103906 / rank | |||
Normal rank | |||
Latest revision as of 20:01, 30 December 2024
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
27 June 2023
0 references
genetic programming
0 references
computational complexity
0 references
theory
0 references
0 references
0 references
0 references
0 references
