The Singularity Is Nearer: When We Merge with AI

by Ray Kurzweil

Cellular automata are simple models represented by “cells” that alternate between states (e.g., black or white, dead or alive) based on one of many possible sets of rules. These rules specify how each cell will behave based on the states of nearby cells. This process unfolds over a series of discrete steps and can produce highly complex behavior. One of the most famous examples of cellular automata is called Conway’s Game of Life and uses a two-dimensional grid.[19] Hobbyists and mathematicians have found numerous interesting shapes that form predictably evolving patterns according to the rules of Life. Life can even be used to replicate a functional computer or simulate the software to run and display another version of itself! Wolfram’s theory starts with very basic automata—cells in a one-dimensional line, below which new lines are added sequentially based on a set of rules and the states of the cells in the preceding line. Through extensive analysis, Wolfram points out that with some sets of rules, regardless of the number of steps being considered, you cannot predict future states without going through each of the intermediate iterations.[20] There is no shortcut to summarize the result.