This is a browser-based cellular automaton experiment that takes a different approach to the same challenge as the trend-aware experiment: how do you keep a self-tuning CA alive and interesting? Here the key innovation is that the rule parameters are not uniform scalars — they are spatial fields.… Read More “Neural CA: Spatial Parameter Fields and Greatest-Hits Memory”
Category Archives: Code
Neural CA: Trend-Aware Agents Learn to Keep a Cellular Automaton Alive
This is a browser-based cellular automaton in which two cooperating neural agents learn — in real time, from scratch — to keep the simulation alive and interesting. No pre-training, no external data. The neural network trains itself as the simulation runs, and the agents use what they’ve learned to steer the system away from death and toward sustained complex behavior.… Read More “Neural CA: Trend-Aware Agents Learn to Keep a Cellular Automaton Alive”
My Public Code Repositories
All of my public repositories are on GitHub at github.com/novaspivack. This post collects the non-Lean code projects — simulations, experiments, and mathematical software — along with pointers to the formal research they connect to.
For the Lean 4 formal proof libraries (17 repos covering the full NEMS research program), see the research index or the Zenodo program hub.… Read More “My Public Code Repositories”
SocioLife – A Socio-Economic Artificial Life Sim That Runs in your Browser
Check out this amazing new artificial life simulation I have developed.
Click here to run it in your browser
(It’s graphics intensive so it’s best if you have a high performance modern computer like a multicore mac or pc.)
Turn the sound on to hear the alien soundscape (use the checkbox on the HUD)
Summary:
SocioLife evolves intelligent agents with DNA that evolve and interact, forming complex societies that then engage in economic, diplomatic, and military relations.… Read More “SocioLife – A Socio-Economic Artificial Life Sim That Runs in your Browser”
Introducing LACE – A New Kind of Cellular Automata
This article is about a new kind of simple computational rule (“LACE rules” running on LACE, the Link Automata Computing Engine platform) which, when applied locally on a grid of cells, demonstrates fascinating emergent “artificial life” behavior.
For readers familiar with the Game of Life (GOL), this is a next-level class of cellular automata that utilizes neighborhood topology — the state of the grid is a function of both cell states and their connectivity (links).… Read More “Introducing LACE – A New Kind of Cellular Automata”