A universal cellular automaton is a cellular automaton which, like a Turing machine, exhibits universality. von Neumann proved that an automaton consisting of cells with four orthogonal neighbors and 29 possible states would be capable of simulating a Turing machine for some configuration of about 200000 cells.
We guarantee you’ll find the right tutor, or we’ll cover the first hour of your lesson.