Reference library
Simple self-reproducing universal automata
Paper summary
Constructs self-reproducing universal arrays using cells with small internal programs. The design trades richer elementary automata for simpler programming than earlier constructions from very simple finite-state cells.
Relevance to the project
Relevant to the choice of foundational primitive: construction complexity can move between substrate and encoded organization. Record both when assessing emergence.
Engineered self-reproduction does not establish evolved or resource-maintained life.
Source record
- Reference ID
- doi-10-1016-s0019-9958-66-90220-8
- Archived version
- Published paper scan hosted by MIT
- Summary provenance
- reference-library/papers/doi-10-1016-s0019-9958-66-90220-8/metadata.json · summary
- Review status
- initial orientation summary; not a critical full-paper review
- Reading scope
- Selected abstract/opening and available closing discussion/conclusion passages in the preserved text extract; broader project notes provide context. No reproduction of experiments, exhaustive methods review, or equation/figure audit.