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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-01657015
Contributor : Hal Ifip <>
Submitted on : Wednesday, December 6, 2017 - 11:44:40 AM
Last modification on : Friday, October 4, 2019 - 1:12:39 AM

File

 Restricted access
To satisfy the distribution rights of the publisher, the document is embargoed until : 2020-01-01

Please log in to resquest access to the document

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

259