ConwayLife.com

Following up on NNlk05's question with one concrete rule. In the story engine, entity memory is a 1-D row of cells. An event enters as a packet at the left end and is copied one cell right per synchronous tick. Each cell sees only its own state and the packet from its left neighbour. The rule is ...

Very interesting; can you elaborate on how it works?


Thanks! In short: CAEL's update rules aren't trained with gradients. They're integer field-copy programs fitted from labelled transitions produced by a hand-written synthetic "teacher": for each transition, the fitter picks the opcodes that ...

Hi all, I'm Gleeb, the author. CAEL is an experiment in putting an integer cellular automaton at the centre of a small chat assistant, with symbolic engines around it (exact maths, a bounded Python interpreter that checks the code it writes, WordNet-based retrieval, session memory). There is no ...