Complexity-preserving simulations among three variants of accepting networks of evolutionary processors

DOI10.1007/s11047-010-9238-5zbMath1232.68048OpenAlexW2071077976MaRDI QIDQ537856

Paolo Bottoni, Ion Petre, Victor Mitrana, Jose M. Sempere, Anna Labella, Florin Manea

Publication date: 23 May 2011

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

Full work available at URL: https://doi.org/10.1007/s11047-010-9238-5

zbMATH Keywords

filtered connectionnetworks of evolutionary processors

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical problems of computer architecture (68M07)

Related Items

Simulating polarization by random context filters in networks of evolutionary processors ⋮ Small networks of polarized splicing processors are universal ⋮ On the computational power of networks of polarized evolutionary processors ⋮ Filters defined by random contexts versus polarization in networks of evolutionary processors ⋮ Polarization: a new communication protocol in networks of bio-inspired processors

Cites Work

• Evolutionary systems: A language generating device inspired by evolving communities of cells
• Computing with membranes
• On the size of computationally complete hybrid networks of evolutionary processors
• Networks of Evolutionary Picture Processors with Filtered Connections
• ON THE DESCRIPTIONAL COMPLEXITY OF ACCEPTING NETWORKS OF EVOLUTIONARY PROCESSORS WITH FILTERED CONNECTIONS
• On the Power of Networks of Evolutionary Processors
• Filter Position in Networks of Evolutionary Processors Does Not Matter: A Direct Proof
• DNA Computing
• On the size complexity of universal accepting hybrid networks of evolutionary processors
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity-preserving simulations among three variants of accepting networks of evolutionary processors