Lenia – Mathematical Life Forms
github.com
github.com
The abstract of the paper linked in the readme[1] makes it pretty clear that the usage of the word "life" should be interpreted as a reference to cellular automata:
> A new system of artificial life called Lenia (from Latin lenis “smooth”), a two-dimensional cellular automaton with continuous spacetime state and generalized local rule, is reported. Computer simulations show that Lenia supports a great diversity of complex autonomous patterns or “life forms” bearing resemblance to real-world microscopic organisms. More than 400 species in 18 families have been identified, many discovered via interactive evolutionary computation. They differ from other cellular automata patterns in being geometric, metameric, fuzzy, resilient, adaptive and rule generic.
As for how they are different from general dynamical systems, the GDSs I've seen have a small set of differential equations that describe the whole system; a cellular automaton has the same rule for each cell but the system comprises a large number of cells. In other words, locality and massive parallelism.
But this isn't my field so correct me if I'm wrong...
And even classical game of live is turing complete. They built a TM inside GoL!
But it can be modeled by a finite state automaton (if the grid is finite), I suppose, so the rules are just a regular grammar.
A regular machine can output the grammar of a context sensitive language, but not accept the corresponding programms. In the same sense, the turing machine in GoL is ...
you know what, I have no idea.
In other words, each cell would encode its distance to all other cells. Which seems a bit redundant.
Can't upvote though, as it did not remind me of anything. It's new to me. Wonder what it has to do with optics.
the terms of R remind me a bit of the collatz sequence, as 2x^2-1 gives the first branches from the root (times 3).