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.
Type de document :
Communication dans un congrès
Giovanni Pighizzini; Cezar Câmpeanu. 19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. Springer International Publishing, Lecture Notes in Computer Science, LNCS-10316, pp.140-151, 2017, Descriptional Complexity of Formal Systems. 〈10.1007/978-3-319-60252-3_11〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01657015
Contributeur : Hal Ifip <>
Soumis le : mercredi 6 décembre 2017 - 11:44:40
Dernière modification le : jeudi 7 décembre 2017 - 01:04:41

Fichier

 Accès restreint
Fichier visible le : 2020-01-01

Connectez-vous pour demander l'accès au fichier

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Rudolf Freund, Vladimir Rogojin, Sergey Verlan. Computational Completeness of Networks of Evolutionary Processors with Elementary Polarizations and a Small Number of Processors. Giovanni Pighizzini; Cezar Câmpeanu. 19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. Springer International Publishing, Lecture Notes in Computer Science, LNCS-10316, pp.140-151, 2017, Descriptional Complexity of Formal Systems. 〈10.1007/978-3-319-60252-3_11〉. 〈hal-01657015〉

Partager

Métriques

Consultations de la notice

7