Evolving Asynchronous and Scalable Non-uniform Cellular Automata

Abstract

We have previously shown that non-uniform cellular automata (CA) can be evolved to perform computational tasks, using the cellular programming algorithm. In this paper we focus on two novel issues, namely, the evolution of asynchronous CAs, and the scalability of evolved synchronous systems. We find that asynchrony presents a more difficult case for evolution though good CAs can still be attained. We describe an empirically derived scaling procedure by which successful CAs of any size may be obtained from a particular evolved system. Our motivation for this study stems in part from our desire to attain realistic systems that axe more amenable to implementation as “evolving ware,” evolware.