Abstract
One-layer space-invariant Cellular Neural Networks (CNNs) are widely appreciated for their simplicity and versatility; however, such structures are not able to solve non-linearly separable problems. In this paper we show that a polynomial CNN - that has with a direct VLSI implementation - is capable of dealing with the 'Game of Life', a Cellular Automaton with the same computational complexity as a Turing machine. Furthermore, we describe a simple design algorithm that allows to convert the rules of a Cellular Automaton into the weights of a polynomial CNN.
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.
