Abstract
The density classification task (DCT for short) is one of the most studied benchmark problems for analyzing emergent computations performed by cellular automata. Starting from the observation that the performance of the best known solutions is not stable towards initial configurations size; we propose in this paper, some new evolutionary mechanisms for designing new solutions with similar conceptual properties to the best known ones. The approach is based on varying the size of initial configurations which allows making comparisons and analysis between the different solutions. We show then through a set of numerical results that the proposed mechanism allows collecting solutions for the DCT more efficiently and with reduced efforts. Also, we show that the collected solutions are affected by configurations size variations, where only few of them are scalable.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.