Autopoietic Networks (a few more examples)
The article discusses autopoietic networks, a type of cellular automaton designed to simulate autopoiesis. It describes how cells in a network update their states based on their gates and the states of neighboring cells. Various examples are provided, showcasing different gate types and propagation rules within the network.
- ▪Autopoietic networks are cellular automata that simulate autopoiesis.
- ▪Cells update their states based on their gates and neighboring states.
- ▪Different examples illustrate the use of various gates and propagation rules.
Opening excerpt (first ~120 words) tap to expand
Autopoietic Networks (a few more examples) This is a type of cellular automaton which was initially designed to simulate autopoiesis. Here, a network of $N × N$ cells is initialized with a state and a corresponding gate associated to it. In the example below for instance, the cells in a small central square region have their state initialized to 1 (the rest of them to 0), but every cell in the network has a gate randomly sampled from a given set (examples below with AND, OR and XOR). After each iteration, each cell updates its state according to the gate allocated to it, and according to the neighbors’ states (itself included) in a radius $r$.
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at Github.
Discussion
0 commentsMore from Github
