Where academic tradition
meets the exciting future

You are here: TUCS > PUBLICATIONS > Publication Search > Computational Completeness of ...

Computational Completeness of Complete, Star-Like, and Linear Hybrid Networks of Evolutionary Processors with a Small Number of Processors

Artiom Alhazov, Rudolf Freund, Vladimir Rogozhin, Yurii Rogozhin, Computational Completeness of Complete, Star-Like, and Linear Hybrid Networks of Evolutionary Processors with a Small Number of Processors. Natural Computing 15(1), 51–68, 2016.

http://dx.doi.org/10.1007/s11047-015-9534-1

Abstract:

A hybrid network of evolutionary processors (HNEP) is a graph where each node is associated with a special rewriting system called an evolutionary processor, an input filter, and an output filter. Each evolutionary processor is given a finite set of one type of point mutations (insertion, deletion or a substitution of a symbol) which can be applied to certain positions in a string. An HNEP rewrites the strings in the nodes and then redistributes them according to a filter-based communication protocol; the filters are defined by certain variants of random-context conditions. HNEPs can be considered both as languages generating devices (GHNEPs) and language accepting devices (AHNEPs); most previous approaches treated the accepting and generating cases separately. For both cases, in this paper we show that five nodes are sufficient to accept (AHNEPs) or generate (GHNEPs) any recursively enumerable language by showing the more general result that any partial recursive relation can be computed by an HNEP with (at most) five nodes with the underlying graph structure for the communication between the evolutionary processors being the complete or the linear graph with five nodes, whereas with a star-like communication graph we need six nodes. If the final results are defined by only taking the terminal strings out of the designated output node, then for these extended HNEPs we can prove that only four nodes are needed in all cases—for computing any partial recursive relation as well as for generating and accepting any recursively enumerable language and the underlying communication structure can be a complete or a linear graph, but now even a star-like graph, too.

BibTeX entry:

@ARTICLE{jAlFrRoRo16a,
  title = {Computational Completeness of Complete, Star-Like, and Linear Hybrid Networks of Evolutionary Processors with a Small Number of Processors},
  author = {Alhazov, Artiom and Freund, Rudolf and Rogozhin, Vladimir and Rogozhin, Yurii},
  journal = {Natural Computing},
  volume = {15},
  number = {1},
  publisher = {Springer Nature},
  pages = {51–68},
  year = {2016},
  keywords = {Circular Post machines, Communication graph, Computational completeness, Hybrid networks of evolutionary processors},
}

Belongs to TUCS Research Unit(s): Computational Biomodeling Laboratory (Combio Lab)

Publication Forum rating of this publication: level 1

Edit publication