claim
active
claim:allowing-evolutionary-operators-themselves-to-be-subject-to-evolutionary-change-meta-level-modification-can-make-genetic-programming-more-efficientAllowing evolutionary operators themselves to be subject to evolutionary change (meta-level modification) can make genetic programming more efficient.
Supports the paper's argument that self-modification, not just self-reference, is tractable and beneficial computationally.
Source paper
extracted_from(2026) · Samson Abramsky · Wolfgang Banzhaf · Leo S. D. Caves · Michael Levin +4
Neighborhood — ranked by edge-count
Papers (1)
paper
Methods (1)
method
- Evolutionary technique that evolves computer programs, discussed as a route toward self-modifying models.
Related by similarity (8)
cosine ≥ 0.65 · no typed edgeEntities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.
- A claim about the outcome of the MCA-enhanced process.
- Claim linking the indirect genotype-phenotype mapping to robustness and open-endedness.
- Evolution learns to generalize beyond default morphologies, producing problem-solving machines.claim0.781Argues that evolutionary learning goes beyond specific adaptations.
- Main functional claim about MCA.
- Practical implication of Observation 2 in evolver-side analysis
- Subclaim of how MCA speeds evolution.
- Central thesis of the paper.