Conway's FPGA game of logical life with Neural Nets
It has already been shown that Conway's game of life is Turing complete. People have created a whole CPU in the game.
Now assume that each cell can be implemented as a 2-bit lookup table. Clearly one can create a game of life simulation where each 2-bit table either computes a 0 or a 1. That would be an exact simulation of Conway's game.
A generalization of the game would be that each cell can accept 2 input bits and would compute a bit output bit using a lookup table. Thus a cell could output compute any possible combination of 2 bits. A cell could compute an XOR, AND, OR, NOT, 0, 1, etc. Indeed, by ganging together multiple cells any combinatorial logic function could be implemented.
A second generalization is to create "clock domains" so each cell only computes when a "clock" signal arrives. Assume that the clock signal is not universal but that many clocks exist that control a subset of the cells (clock domains).
The cells have "memory" as they continue to assert their output bit at every clock tick.
Cells can be born, live, die, or change their lookup table value based on the rules.
Now you have a "Cellular FPGA". But this FPGA can grow and adapt dynamically rather than being pre-programmed.
What are the new Conway's rules for such a simulation?
Now consider what happens when we try to architecture a Neural Network on this cellular FPGA. Each "neuron" is a combinatorial logic "cell" that computes a weighted function of its inputs and bias. The Neural Net can adapt because weighted logic "cells" that fall to 0 weights can simply "die" and be reborn as something else in a circuit being "born" later.
Now consider creating real, physical wafer-scale hardware that computes this way using a whole-wafer "Conway chip". The whole physical chip "learns". https://www.cerebras.net/blog/wafer-scale-processors-the-time-has-come/