Abstract
This paper is a survey of E. Goles’ work on dynamical systems from the point of view of universality and computability. The models considered by E. Goles and his collaborators are presented: neural networks, reaction–diffusion automata, chip-firing games, sand piles, and artificial ants. Then, we recall the corresponding universality results. We also provide a classification of methods for proving universality and apply it to the aforementioned constructions.
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.
