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

Recommendations

Computational completeness of networks of evolutionary processors with elementary polarizations and a small number of processors
On the size of computationally complete hybrid networks of evolutionary processors
Hybrid networks of evolutionary processors are computationally complete
On the size complexity of hybrid networks of evolutionary processors
Five nodes are sufficient for hybrid networks of evolutionary processors to be computationally complete
Networks of polarized evolutionary processors are computationally complete
Complexity results for deciding networks of evolutionary processors
A survey on computationally complete accepting and generating networks of evolutionary processors
Networks of evolutionary processors: computationally complete normal forms
On the size complexity of universal accepting hybrid networks of evolutionary processors

Cites work

scientific article; zbMATH DE number 1728707 (Why is no real title available?)
scientific article; zbMATH DE number 2013489 (Why is no real title available?)
scientific article; zbMATH DE number 941396 (Why is no real title available?)
scientific article; zbMATH DE number 1839446 (Why is no real title available?)
scientific article; zbMATH DE number 3413820 (Why is no real title available?)
About Universal Hybrid Networks of Evolutionary Processors of Small Size
Accepting hybrid networks of evolutionary processors with special topologies and small communication
All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size
Circular Post machines and P systems with exo-insertion and deletion
DNA Computing
Five nodes are sufficient for hybrid networks of evolutionary processors to be computationally complete
Formal Reductions of the General Combinatorial Decision Problem
Generating and accepting P systems with minimal left and right insertion and deletion
Hybrid networks of evolutionary processors are computationally complete
Nine universal circular Post machines
On Networks of Evolutionary Processors with Nodes of Two Types
On the number of nodes in universal networks of evolutionary processors
On the power of accepting networks of evolutionary processors with special topologies and random context filters
On the size complexity of universal accepting hybrid networks of evolutionary processors
On the size of computationally complete hybrid networks of evolutionary processors
Small universal accepting hybrid networks of evolutionary processors
Small universal circular Post machines
Smallest filters in complete obligatory hybrid networks of evolutionary processors

Cited in

(12)

Networks of evolutionary processors: computationally complete normal forms
Five nodes are sufficient for hybrid networks of evolutionary processors to be computationally complete
Smallest filters in complete obligatory hybrid networks of evolutionary processors
Accepting hybrid networks of evolutionary processors with special topologies and small communication
Hybrid networks of evolutionary processors are computationally complete
(Tissue) P systems with vesicles of multisets
On the size of computationally complete hybrid networks of evolutionary processors
About precise characterization of languages generated by hybrid networks of evolutionary processors with one node
About Universal Hybrid Networks of Evolutionary Processors of Small Size
Developments in networks of evolutionary processors
Variants of Networks of Evolutionary Processors with Polarizations and a Small Number of Processors
Tissue P Systems with Vesicles of Multisets

This page was built for publication: Computational completeness of complete, star-like, and linear hybrid networks of evolutionary processors with a small number of processors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2003446)