Asynchronous self-reproducing loops with arbitration capability
From MaRDI portal
Publication:875458
Recommendations
Cites work
- scientific article; zbMATH DE number 3898244 (Why is no real title available?)
- scientific article; zbMATH DE number 3606384 (Why is no real title available?)
- scientific article; zbMATH DE number 1342308 (Why is no real title available?)
- scientific article; zbMATH DE number 2013811 (Why is no real title available?)
- scientific article; zbMATH DE number 1480194 (Why is no real title available?)
- scientific article; zbMATH DE number 3338162 (Why is no real title available?)
- scientific article; zbMATH DE number 3363435 (Why is no real title available?)
- Asynchronous game of life
- Construction universality in purely asynchronous cellular automata
- Graph automata: Natural expression of self-reproduction
- Heredity, Complexity, and Surprise: Embedded Self-Replication and Evolution in CA
- Self-Timed Cellular Automata and their computational ability
- Self-replicating loop with universal construction
- Self-reproduction in a reversible cellular space
- Simple systems that exhibit self-directed replication
- UNIVERSAL CONSTRUCTION AND SELF-REPRODUCTION ON SELF-TIMED CELLULAR AUTOMATA
- Universal delay-insensitive systems with buffering lines
Cited in
(3)
This page was built for publication: Asynchronous self-reproducing loops with arbitration capability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q875458)