Computational completeness of complete, star-like, and linear hybrid networks of evolutionary processors with a small number of processors

Variants of Networks of Evolutionary Processors with Polarizations and a Small Number of Processors

“…[14], yet we considerably improve the number of processors (cells) needed to obtain computational completeness from 35 to 7, which makes these results already comparable with those obtained in Ref. [1] for hybrid networks of evolutionary processors using permitting and forbidden contexts as filters for the communication of strings between cells.…”

“…are called computationally complete if these systems are able to compute any partial recursive relation R on strings over any alphabet U . Computational completeness in the usual sense with respect to acceptance and generation directly follows from this general kind of computational completeness; for more details we refer to [1]. The definitions of the succeeding subsections are mainly taken from [1] and [14].…”

“…In fact, in Ref. [1] this variant was called with terminal extraction. On the other hand, we may require a special output cell where only the terminal strings appear, which we will consider as the standard variant.…”

“…Furthermore, the filters are defined by some variants of random-context conditions, i.e., they check the presence and the absence of certain symbols in the strings. For an overview on HNEPs and the latest known results, we refer the reader to [1].…”

(Tissue) P Systems with Vesicles of Multisets

“…Furthermore, the filters are defined by some variants of random-context conditions, i.e., they check the presence and the absence of certain symbols in the strings. For an overview on HNEPs and the best results known so far, we refer the reader to [1].…”