Computational completeness of complete, star-like, and linear hybrid networks of evolutionary processors with a small number of processors
DOI10.1007/S11047-015-9534-1zbMATH Open1415.68069OpenAlexW2255003438MaRDI QIDQ2003446FDOQ2003446
Authors: Artiom Alhazov, Rudolf Freund, Vladimir Rogojin, Yurii Rogozhin 
Publication date: 8 July 2019
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11047-015-9534-1
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
computational completenesscommunication graphcircular Post machineshybrid networks of evolutionary processors
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Grammars and rewriting systems (68Q42)
Cites Work
- On the size of computationally complete hybrid networks of evolutionary processors
- Generating and accepting P systems with minimal left and right insertion and deletion
- Title not available (Why is that?)
- Circular Post machines and P systems with exo-insertion and deletion
- On Networks of Evolutionary Processors with Nodes of Two Types
- Title not available (Why is that?)
- Accepting hybrid networks of evolutionary processors with special topologies and small communication
- DNA Computing
- Formal Reductions of the General Combinatorial Decision Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the size complexity of universal accepting hybrid networks of evolutionary processors
- Small universal accepting hybrid networks of evolutionary processors
- On the power of accepting networks of evolutionary processors with special topologies and random context filters
- Smallest filters in complete obligatory hybrid networks of evolutionary processors
- All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size
- Title not available (Why is that?)
- Hybrid networks of evolutionary processors are computationally complete
- On the number of nodes in universal networks of evolutionary processors
- About Universal Hybrid Networks of Evolutionary Processors of Small Size
- Nine universal circular Post machines
- Five nodes are sufficient for hybrid networks of evolutionary processors to be computationally complete
- Small universal circular Post machines
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)
