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.
Hacker News (Newest) files mainly under programming. We currently carry 5,306 of its stories.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Story provenance
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | Github |
| Canonical URL | https://gbragafibra.github.io/2025/05/27/autopoietic_nets2.html |
| Publication time | Tue, 26 May 2026 22:27:52 +0000 |
| Retrieval time | 2026-05-26T22:37:54.885Z |
| Last seen | 2026-05-26T22:37:54.885Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | OIKN-bGoykIl |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
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
