Neat AI does Lenia - Conway's game of life arrives in the 21st century

How Lenia extends Conway's Game of Life into a continuous, real-valued mathematical field with complex, lifelike behaviors.

Conway's game of life arrives in the 21st century with a multi-dimensional upgrade !! {{ Now with Spanish Subtitles, created by cristinaroja575 on Fiveer }} Thanks to Bert Chan who has been working on these for the last couple of years and sharing his discoveries.. Video snippets from the following (all have the Creative Commons Attribution license attribute) youtu.be/HT49wpyux-k youtu.be/iE46jKYcI4Y youtu.be/ij1k2pxdQNU Paper: arxiv.org/abs/2005.03742 Code: github.com/Chakazul/Lenia Also check out Alan Zucconi Let’s BUILD a COMPUTER in CONWAY's GAME of LIFE ⠠⠵ youtu.be/Kk2MH9O4pXY =============================================================================== From Wikipedia : en.wikipedia.org/wiki/Conway%27s_Game_of_Life The Game of Life, also known simply as Life, is a cellular automaton devised by the British mathematician John Horton Conway in 1970.[1] It is a zero-player game, meaning that its evolution is determined by its initial state, requiring no further input. One interacts with the Game of Life by creating an initial configuration and observing how it evolves. It is Turing complete and can simulate a universal constructor or any other Turing machine. Origins In late 1940, John von Neumann defined life as a creation (as a being or organism) which can reproduce itself and simulate a Turing machine. Von Neumann was thinking about an engineering solution which would use electromagnetic components floating randomly in liquid or gas. This turned out not to be realistic with the technology available at the time. Stanislaw Ulam invented cellular automata, which were intended to simulate von Neumann's theoretical electromagnetic constructions. Ulam discussed using computers to simulate his cellular automata in a two-dimensional lattice in several papers. In parallel, von Neumann attempted to construct Ulam's cellular automaton. Although successful, he was busy with other projects and left some details unfinished. His construction was complicated because it tried to simulate his own engineering design. Over time, simpler life constructions were provided by other researchers, and published in papers and books.[citation needed] Motivated by questions in mathematical logic and in part by work on simulation games by Ulam, among others, John Conway began doing experiments in 1968 with a variety of different two-dimensional cellular automaton rules. Conway's initial goal was to define an interesting and unpredictable cell automaton. For example, he wanted some configurations to last for a long time before dying and other configurations to go on forever without allowing cycles. It was a significant challenge and an open problem for years before experts on cellular automata managed to prove that, indeed, the Game of Life admitted of a configuration which was alive in the sense of satisfying von Neumann's two general requirements. While the definitions before the Game of Life were pro