The CNN Universal Machine is as universal as a Turing Machine

摘要

It is shown that the simplest integrated circuit implementations of the CNN Universal Machine can play the "game of life", and are therefore equivalent to Turing Machines. In addition, a constructive proof is given for the direct implementation of general first-order cellular automata on such machines.