Researchers Introduce Programmable Cellular Automata: CA Rules as Readable Code
SimonGColton · x · 2026-09-10
Togelius and colleagues present a new paper on Programmable Cellular Automata (PCA). They argue classic CA rules are just lookup tables with limited expressiveness, while neural cellular automata are expressive but a black box. PCA's middle ground: each CA rule is written as human-readable code, combining editability with expressiveness. The authors say they're surprised the idea hasn't been explored before and report interesting results.
Related event: Researchers Propose Programmable Cellular Automata with Readable Code Rules(3 posts)→
More from Research
- FrogNano: a 4B model trained purely with RL on synthetic tasks hits repo-level coding — burkov · 2026-09-10
- Stanford lab rebuilt as interactive 3D web scene in a day with GPT-6 Astra and Retriever — OfirPress · 2026-09-10
- VisionCoach: RL framework rewards correct visual attention for grounded video reasoning, SOTA zero-shot — mohitban47 · 2026-09-10
- Goodfire explains how probes can read model minds to catch cyber intent and reward hacking — leland_mcinnes · 2026-09-10
- Engineer deploys hundreds of parallel AI agents to work on a type 1 diabetes cure — Scobleizer · 2026-09-10
- SOFAIR lab launches with UCL, Cambridge, Oxford, Edinburgh to do Science for AI — latticecut · 2026-09-10