The Turing machine is, as its name suggests, a pattern that is capable of Turing-complete computation. It was created by Paul Rendell and its construction was completed on April 2, 2000. This particular Turing machine is infinite, as it requires an infinite length of tape to perform arbitrary computations. On February 10, 2010 the Turing machine was extended into a universal Turing machine and can itself be simulated within it.
On April 5th, 2018, Michael Simkin posted a script which can simulate arbitrary Turing machines in Conway's Game of Life using a finite tape.
High-resolution image of the Turing machine
External links and further reading