Abstract
The author summarizes an extensive numerical study of basin and attractor sizes among the 88 distinct elementary cellular automata (CA) rules. Based on this study and on previous work in discretized dynamical systems, he proposes a new classification of CA, complementary to that of Wolfram, in which attractor globality is important. With the use of fixed boundary conditions he finds global periodic attractors in CA for the first time. Not a single instance of attractor chaos is observed in this class of rules.
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.
