Accepting networks of splicing processors: complexity results

DOI10.1016/j.tcs.2006.10.015zbMath1108.68052OpenAlexW2083313660MaRDI QIDQ870258

Carlos Martín-Vide, Florin Manea, Victor Mitrana

Publication date: 12 March 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.10.015

zbMATH Keywords

communicationproblem solvingcomplexity classsplicing processor

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items

Networks of Polarized Splicing Processors, All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size, Networks of splicing processors: simulations between topologies, Small networks of polarized splicing processors are universal, Filters defined by random contexts versus polarization in networks of evolutionary processors, Accepting networks of genetic processors are computationally complete, Networks of splicing processors with evaluation sets as optimization problems solvers, On small, reduced, and fast universal accepting networks of splicing processors, Polarization: a new communication protocol in networks of bio-inspired processors, A Linear Time Solution for N-Queens Problem Using Generalized Networks of Evolutionary Polarized Processors, Universality of SNQ P Systems Using One Type of Spikes and Restrictive Rule Application

Cites Work

• Multiplicities: A deterministic view of nondeterminism
• Networks of evolutionary processors
• Evolutionary systems: A language generating device inspired by evolving communities of cells
• On the size complexity of hybrid networks of evolutionary processors
• Hybrid networks of evolutionary processors are computationally complete
• On the Computational Complexity of Algorithms
• DNA Computing
• Machines, Computations, and Universality
• New Computational Paradigms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item