Polarization: a new communication protocol in networks of bio-inspired processors
From MaRDI portal
Publication:2299886
DOI10.1007/s41965-018-0001-9zbMath1431.68032OpenAlexW2912798484MaRDI QIDQ2299886
Publication date: 24 February 2020
Published in: Journal of Membrane Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s41965-018-0001-9
polarizationcomputational powersplicing processorevolutionary processorevaluation setmultiset processor
Network protocols (68M12) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the computational power of networks of polarized evolutionary processors
- Complexity-preserving simulations among three variants of accepting networks of evolutionary processors
- Accepting networks of genetic processors are computationally complete
- Networks of polarized multiset processors
- 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
- On small, reduced, and fast universal accepting networks of splicing processors
- The complexity of small universal Turing machines: A survey
- Networks of evolutionary processors
- Evolutionary systems: A language generating device inspired by evolving communities of cells
- Membrane computing. An introduction.
- On the splicing operation
- On the size of computationally complete hybrid networks of evolutionary processors
- Networks of splicing processors with evaluation sets as optimization problems solvers
- Handbook of Natural Computing
- Filter Position in Networks of Evolutionary Processors Does Not Matter: A Direct Proof
- Parallel Algorithms for Knapsack Type Problems
- TIME-VARYING DISTRIBUTED H SYSTEMS OF DEGREE 1 GENERATE ALL RECURSIVELY ENUMERABLE LANGUAGES
- Networks of Polarized Splicing Processors
- Networks of Polarized Evolutionary Processors Are Computationally Complete
- Accepting Networks of Evolutionary Picture Processors
- All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size
- DNA Computing
- On the size complexity of universal accepting hybrid networks of evolutionary processors
- Formal Reductions of the General Combinatorial Decision Problem
- Small networks of polarized splicing processors are universal
This page was built for publication: Polarization: a new communication protocol in networks of bio-inspired processors