Computational Completeness of Networks of Evolutionary Processors with Elementary Polarizations and a Small Number of Processors
Abstract
We improve previous results obtained for networks of evolutionary processors with elementary polarizations $-1,0,1$ by showing that only the very small number of seven processors is needed to obtain computational completeness. In the case of not requiring a special output node even only five processors are shown to be sufficient.
Domains
Computer Science [cs]
Origin : Files produced by the author(s)
