Accepting networks of genetic processors are computationally complete
type: Item
instance of: scholarly article
title: Accepting networks of genetic processors are computationally complete
zbMATH Open document ID: 1309.68067
author: M. Campos
author: Jose M. Sempere
published in: Theoretical Computer Science
publication date: 2012-10-11T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 6093064
zbMATH Keywords: parallel genetic algorithms
zbMATH Keywords: networks of biologically-inspired processors
zbMATH Keywords: computational completeness
describes a project that uses: Genocop
MaRDI profile type: Publication
full work available at URL: j.tcs.2012.06.028
OpenAlex ID: W1999436197
cites work: A Machine-Independent Theory of the Complexity of Recursive Functions
cites work: Q4523517
cites work: Q2780162
cites work: Networks of evolutionary processors
cites work: The role of evolutionary operations in accepting hybrid networks of evolutionary processors
cites work: On the Power of Networks of Evolutionary Processors
cites work: Q4942157
cites work: Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
cites work: Q5592246
cites work: All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size
cites work: Accepting networks of splicing processors: complexity results
cites work: New Computational Paradigms
cites work: DNA Computing
cites work: Q4873721
cites work: Accepting splicing systems
cites work: On Accepting Networks of Evolutionary Processors with at Most Two Types of Nodes
cites work: Membrane computing. An introduction.
cites work: Q4223673
DOI: 10.1016/J.TCS.2012.06.028
description: scientific article; zbMATH DE number 6093064