Small networks of polarized splicing processors are universal

DOI10.1007/S11047-018-9691-0zbMath1528.68109OpenAlexW2809273201WikidataQ129654048 ScholiaQ129654048MaRDI QIDQ6062027

Mihaela Păun, Andrei Păun, Henning Bordihn, Maria C. Negru, Victor Mitrana

Publication date: 30 November 2023

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-018-9691-0

zbMATH Keywords

polarizationTuring machine2-tag systemsplicing processorcomputing with DNA

Mathematics Subject Classification ID

Classical models of computation (Turing machines, etc.) (68Q04) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Related Items (2)

Networks of splicing processors: simulations between topologies ⋮ Polarization: a new communication protocol in networks of bio-inspired processors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity-preserving simulations among three variants of accepting networks of evolutionary processors
• Accepting networks of splicing processors: complexity results
• On small, reduced, and fast universal accepting networks of splicing processors
• The complexity of small universal Turing machines: A survey
• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• Small universal Turing machines
• Evolutionary systems: A language generating device inspired by evolving communities of cells
• On the splicing operation
• All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size
• DNA Computing
• Formal Reductions of the General Combinatorial Decision Problem

This page was built for publication: Small networks of polarized splicing processors are universal