About complete obligatory hybrid networks of evolutionary processors without substitution

Abstract

In this paper we consider complete obligatory hybrid networks of evolutionary processors (OHNEPs) with insertion and deletion operations (without substitution). Such networks are not computationally complete and we modify the notion of obligatory operation introduced in [1] in order to reach universality. We use very simple evolutionary processors with one modified operation of insertion or deletion per node (without substitution). Using techniques presented in the paper a universal complete OHNEP with 182 nodes can be constructed. © 2011 Springer-Verlag.