So, let's see how the 𝗔𝗡𝗗, 𝗢𝗥 and 𝗡𝗢𝗧 gates can actually be constructed in Conway's Game of Life...
Fifty years have passed since CONWAY'S GAME OF LIFE firstly appeared on a column called "Mathematical Games" on @sciam.
While most Programmers & Computer Science enthusiasts are familiar with it, not many know that the game is actually TURING COMPLETE.
Let's see why. ⠠⠵
🧵👇

So, let's see how the 𝗔𝗡𝗗, 𝗢𝗥 and 𝗡𝗢𝗧 gates can actually be constructed in Conway's Game of Life...
One very popular choice is to use a stream of GLIDERS. The so-called GOSPER GLIDER GUN can generated a new glider every 30 generations. 🔫
Hence, receiving a glider every 30 generations counts as a "1".

This means that a GLIDER GUN can stop an incoming glider stream!
We can exploit this mechanism to simulate a NOT gate:
⬇️ 𝗡𝗢𝗧 0 = 1 ⬇️ 𝗡𝗢𝗧 1 = 0

⬇️ 0 𝗔𝗡𝗗 1 = 0 ⬇️ 1 𝗔𝗡𝗗 0 = 0

⬇️ 1 𝗔𝗡𝗗 1 = 1

This is one step away from TURING COMPLETENESS. ✨
What we need is a memory block! The pattern below works as a SET-RESET LATCH: a simple 1-bit memory register!

If you are interested to learn more about this, this short documentary goes into great length to explain the process of building an actual computer in Conway's Game of Life. ⠠⠵
https://t.co/7e3LKmGfNi