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.
Cite
CITATION STYLE
Freund, R., Rogojin, V., & Verlan, S. (2017). Computational completeness of networks of evolutionary processors with elementary polarizations and a small number of processors. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10316 LNCS, pp. 140–151). Springer Verlag. https://doi.org/10.1007/978-3-319-60252-3_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
