Abstract
Although it is undecidable whether a one-dimensional cellular automaton obeys a given conservation law over its limit set, it is however possible to obtain sufficient conditions to be satisfied by a one-dimensional cellular automaton to be eventually number-conserving. We present a preliminary study of two-input one-dimensional cellular automaton rules called eventually number-conserving cellular automaton rules whose limit sets, reached after a number of time steps of the order of the cellular automaton size, consist of states having a constant number of active sites. In particular, we show how to find rules having given limit sets satisfying a conservation rule. Viewed as models of systems of interacting particles, these rules obey a kind of Darwinian principle by either annihilating unnecessary particles or creating necessary ones.
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.
