Abstract
This review addresses the issues of computations using cellular automata (CA). It is shown that the generality of the connectionism paradigm allows some methods applicable to neural networks to be transferred into the domain of CA. Some special issues of computability are discussed based on the examples of the density classification task, the firing-squad synchronization problem, and the queen-bee problem, as well as sorting algorithms and Atrubin’s parallel multiplication algorithm.
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.
