Conference Papers Year : 2017

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.

Fichier principal
Vignette du fichier
440206_1_En_11_Chapter.pdf (255) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-01657015 , version 1 (06-12-2017)

Licence

Identifiers

Cite

Rudolf Freund, Vladimir Rogojin, Sergey Verlan. Computational Completeness of Networks of Evolutionary Processors with Elementary Polarizations and a Small Number of Processors. 19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.140-151, ⟨10.1007/978-3-319-60252-3_11⟩. ⟨hal-01657015⟩
209 View
114 Download

Altmetric

Share

  • More