Filters defined by random contexts versus polarization in networks of evolutionary processors

DOI10.1016/j.tcs.2020.08.003zbMath1497.68198OpenAlexW3048770246MaRDI QIDQ1998878

Victor Mitrana, Maria C. Negru

Publication date: 9 March 2021

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

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

zbMATH Keywords

polarized evolutionary processorevolutionary operationevolutionary processor with random context filtersrandom-context condition

Mathematics Subject Classification ID

Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Related Items

Simulating polarization by random context filters in networks of evolutionary processors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity-preserving simulations among three variants of accepting networks of evolutionary processors
• Accepting networks of genetic processors are computationally complete
• Accepting networks of splicing processors: complexity results
• Networks of polarized evolutionary processors
• Small universal accepting hybrid networks of evolutionary processors
• A new characterization of NP, P, and PSPACE with accepting hybrid networks of evolutionary processors
• Networks of evolutionary processors
• Evolutionary systems: A language generating device inspired by evolving communities of cells
• Membrane computing. An introduction.
• Filter Position in Networks of Evolutionary Processors Does Not Matter: A Direct Proof
• All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size
• DNA Computing
• New Computational Paradigms
• On the size complexity of universal accepting hybrid networks of evolutionary processors

This page was built for publication: Filters defined by random contexts versus polarization in networks of evolutionary processors