Well, you can use a bitgrid (which is an array of 4 input/4 output bit lookup tables, clocked like the colors of a chess board) to implement the game of life. (

Well, you can use a bitgrid (which is an array of 4 input/4 output bit lookup tables, clocked like the colors of a chess board) to implement the game of life. (Someone else did it for me!)[1] There are several nice properties of a bitgrid, which include fault tolerance (you can route around bad cells), easy security guarantees (as you can wall off sections of "code"), and almost trivial routing (as opposed to the huge times that FPGAs take to route, due to heterogeneity of their hardware) If you need to rotate, invert, or even interleave designs, you can. I've been coding up a simulator in Pascal[2]. It doesn't do much, but it executes at 25 nSec/cell in emulation on my machine. I can execute a 32x32 bitgrid at about 40 khz, almost fast enough to play with audio. A real bitgrid computer (in a cluster) should be capable of sustaining Exaflop performance, but it'll require a whole new programming paradigm. [1] https://esolangs.org/wiki/Bitgrid#Game_of_Life https://esolangs.org/wiki/Bitgrid#Game_of_Life [2] https://github.com/mikewarot/Bitgrid https://github.com/mikewarot/Bitgrid