Designing a Turing-complete cellular automata system using quantum-dot cellular automata

摘要

The quantum-dot cellular automata (QCA) computing paradigm is used to implement Rule 110, a unique one-dimensional cellular automata (CA) that has been proven to be Turing complete. A Turing complete architecture is capable of universal computing, which means that it could be used to implement any arbitrary computation. The optimized design of a single Rule 110 cell is presented, first using Boolean algebra and then by the use of QCA cells. This is followed by simulations to verify the correct behavior of the device and a method for efficiently filling a two-dimensional region with a one-dimensional CA device.