
I Built a Cellular Automata Explorer in WebAssembly — Here Are 21 Visual Experiments
The project Over 21 days in May 2025, I used cellular automata as a daily sketchbook: one tool, one new constraint, one visual experiment per day. The result is CellCosmos — a browser-based elementary cellular automata explorer. The twist: the core automaton logic is written in French-syntax source code using a multilingual programming language I've been building. That French source is compiled to WebAssembly (WASM) and runs at near-native speed in the browser. 🔗 Live tool: multilingualprogramming.github.io/cellcosmos 📦 Source (GPL-3.0): github.com/multilingualprogramming/cellcosmos How it works technically A cellular automaton starts with a finite grid of cells. Each cell holds a discrete state (in CellCosmos, small integers representing phases or ages). At each time step, every cell updates simultaneously based on a lookup at a small local neighborhood. For a 1D elementary CA (the Wolfram model): Each cell looks at itself and its two immediate neighbors → 3 cells → 8 possible binary
Continue reading on Dev.to
Opens in a new tab

![[Learning notes and hw] getting started with R-cnn: Manually implementing Intersection over Union (IoU)](/_next/image?url=https%3A%2F%2Fmedia2.dev.to%2Fdynamic%2Fimage%2Fwidth%3D800%252Cheight%3D%252Cfit%3Dscale-down%252Cgravity%3Dauto%252Cformat%3Dauto%2Fhttps%253A%252F%252Fdev-to-uploads.s3.amazonaws.com%252Fuploads%252Farticles%252Favit2emoxc0g68e5ltqj.jpg&w=1200&q=75)

