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

DOI10.1007/S11047-015-9534-1zbMath1415.68069OpenAlexW2255003438MaRDI QIDQ2003446

Rudolf Freund, Artiom Alhazov, Vladimir Rogozhin, 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

zbMATH Keywords

circular Post machinescomputational completenesscommunication graphhybrid networks of evolutionary processors

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Grammars and rewriting systems (68Q42)

Related Items (3)

Tissue P Systems with Vesicles of Multisets ⋮ Unnamed Item ⋮ Variants of Networks of Evolutionary Processors with Polarizations and a Small Number of Processors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generating and accepting P systems with minimal left and right insertion and deletion
• On the number of nodes in universal networks of evolutionary processors
• Small universal accepting hybrid networks of evolutionary processors
• Nine universal circular Post machines
• Hybrid networks of evolutionary processors are computationally complete
• On the size of computationally complete hybrid networks of evolutionary processors
• All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size
• On the Power of Accepting Networks of Evolutionary Processors with Special Topologies and Random Context Filters
• Circular Post Machines and P Systems with Exo-insertion and Deletion
• Five Nodes Are Sufficient for Hybrid Networks of Evolutionary Processors to Be Computationally Complete
• About Universal Hybrid Networks of Evolutionary Processors of Small Size
• On Networks of Evolutionary Processors with Nodes of Two Types
• DNA Computing
• On the size complexity of universal accepting hybrid networks of evolutionary processors
• Formal Reductions of the General Combinatorial Decision Problem
• Small universal circular Post machines

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