Non-Platonism in NCA

Neural Cellular Automata


    Non-Platonism with respect to temporal resolution (step size $\Delta t$) in a neural CA (NCA) with Lenia (Orbium) kernel. download (mp4).


Previous-- Table of Contents-- Next


    Glider neural cellular automata: a cellular automata combining the radial Gaussian style of neighborhood kernel with neural network dynamics.


    In the NCA example shown here, the NCA update fits directly into the Euler method (no truncation function necessary). Dynamics are encoded in a 2d convolutional network with 1 by 1 kernels and 2 hidden layers, which takes as input channels the current cell states and neighborhoods at time t. [One of the hidden layers is omitted above for brevity].