Computational completeness of complete, star-like, and linear hybrid networks of evolutionary processors with a small number of processors
type: Item
instance of: scholarly article
title: Computational completeness of complete, star-like, and linear hybrid networks of evolutionary processors with a small number of processors
zbMATH Open document ID: 1415.68069
author: Artiom Alhazov
author: Rudolf Freund
author: Vladimir Rogojin
author: Yurii Rogozhin
published in: Natural Computing
publication date: 2019-07-08T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 7077537
zbMATH Keywords: circular Post machines
zbMATH Keywords: communication graph
zbMATH Keywords: computational completeness
zbMATH Keywords: hybrid networks of evolutionary processors
MaRDI profile type: Publication
full work available at URL: s11047-015-9534-1
OpenAlex ID: W2255003438
cites work: Nine universal circular Post machines
cites work: On the number of nodes in universal networks of evolutionary processors
cites work: About Universal Hybrid Networks of Evolutionary Processors of Small Size
cites work: On the size of computationally complete hybrid networks of evolutionary processors
cites work: On Networks of Evolutionary Processors with Nodes of Two Types
cites work: Circular Post Machines and P Systems with Exo-insertion and Deletion
cites work: Q5507054
cites work: Five Nodes Are Sufficient for Hybrid Networks of Evolutionary Processors to Be Computationally Complete
cites work: Q2780162
cites work: Hybrid networks of evolutionary processors are computationally complete
cites work: Q4964011
cites work: On the power of accepting networks of evolutionary processors with special topologies and random context filters
cites work: Generating and accepting P systems with minimal left and right insertion and deletion
cites work: Q4782711
cites work: Small universal circular Post machines
cites work: Small universal accepting hybrid networks of evolutionary processors
cites work: On the size complexity of universal accepting hybrid networks of evolutionary processors
cites work: All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size
cites work: DNA Computing
cites work: Q4436832
cites work: Formal Reductions of the General Combinatorial Decision Problem
cites work: Q4714446
cites work: Q5678435
DOI: 10.1007/S11047-015-9534-1
Recommended article: Computational completeness of networks of evolutionary processors with elementary polarizations and a small number of processors
Recommended article: On the size of computationally complete hybrid networks of evolutionary processors
Recommended article: Hybrid networks of evolutionary processors are computationally complete
Recommended article: On the size complexity of hybrid networks of evolutionary processors
Recommended article: Five Nodes Are Sufficient for Hybrid Networks of Evolutionary Processors to Be Computationally Complete
Recommended article: Networks of Polarized Evolutionary Processors Are Computationally Complete
Recommended article: Complexity results for deciding networks of evolutionary processors
Recommended article: A survey on computationally complete accepting and generating networks of evolutionary processors
Recommended article: Networks of evolutionary processors: computationally complete normal forms
Recommended article: On the size complexity of universal accepting hybrid networks of evolutionary processors
description: scientific article; zbMATH DE number 7077537