Recent studies have shown that non-uniform cellular automata (CA), where cellular rules
need not necessarily be identical, can be co-evolved to perform computational tasks. This
paper extends these studies by generalizing on a second aspect of CAs, namely their
standard, homogeneous connectivity. We study non-standard architectures, where each cell
has a small, identical number of connections, yet not necessarily from its most immediate
neighboring cells. We show that such architectures are computationally more efficient than …