Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
