Implementation of Massive Parallel Networks of Evolutionary Processors (MPNEP): 3-Colorability Problem

Díaz, M.A. Prieto; López, Luis Fernando de Mingo; Blas, Nuria Gómez; Castellanos, Juan

doi:10.1007/978-3-540-78987-1_36

Cited by 6 publications

(11 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…It will turn out, by our further explanations, that if w is accepted by a computation of M that uses the minimal number t of auxiliary cells (cells that initially contain B), then every word wB 3 , with j < t, that enters InsSt will be eventually blocked in a node. We assume that wB 3 , for some j > t, enters InsSt. It is transformed into wB^qo which is negatively charged, such that each node IdS(a,i) (Identify Symbol), 1 < i < n + 1, receives one of its copies.…”

Section: {11}mentioning

confidence: 99%

See 1 more Smart Citation

Networks of Polarized Evolutionary Processors Are Computationally Complete

Arroyo

Canaval

Mitrana

et al. 2014

Language and Automata Theory and Applications

View full text Add to dashboard Cite

Abstract. In this paper, we consider the computational power of a new variant of networks of evolutionary processors which seems to be more suitable for a software and hardware implementation. Each processor as well as the data navigating throughout the network are now considered to be polarized. While the polarization of every processor is predefined, the data polarization is dynamically computed by means of a valuation mapping. Consequently, the protocol of communication is naturally defined by means of this polarization. We show that tag systems can be simulated by these networks with a constant number of nodes, while Turing machines can be simulated, in a time-emcient way, by these networks with a number of nodes depending linearly on the tape alphabet of the Turing machine.

show abstract

Section: {11}mentioning

confidence: 99%

“…Software implementations of NEPs have been reported, see, e.g., [3,4,16], most of them in JAVA. They encountered difiiculties especially in the implementation of filters.…”

Section: Introductionmentioning

confidence: 99%

Networks of Polarized Evolutionary Processors Are Computationally Complete

Arroyo

Canaval

Mitrana

et al. 2014

Language and Automata Theory and Applications

View full text Add to dashboard Cite

show abstract

“…Several software implementations of NEPs have been reported in the literature (see [21][22][23]). Other software simulators for NEP model using massively parallel platforms for multi-core desktop computers, clusters of computers, and cloud resources have been reported in [26,27].…”

Section: Introductionmentioning

confidence: 99%

Polarization: a new communication protocol in networks of bio-inspired processors

Mitrana

2019

J Membr Comput

View full text Add to dashboard Cite

This work is a survey of the most recent results regarding the computational power of the networks of bio-inspired processors whose communication is based on a new protocol called polarization. In the former models, the communication amongst processors is based on filters defined by some random-context conditions, namely the presence of some symbols and the absence of other symbols. In the new protocol discussed here, a polarization (negative, neutral, and positive) is associated with each node, while the polarization of data navigating through the network is computed in a dynamical way by means of a valuation function. Consequently, the protocol of communication amongst processors is naturally based on the compatibility between their polarization and the polarization of the data. We consider here three types of bio-inspired processors: evolutionary processors, splicing processors, and multiset processors. A quantitative generalization of polarization (evaluation sets) is also presented. We recall results regarding the computational power of these networks considered as accepting devices. Furthermore, a solution to an intractable problem, namely the 0 / 1 Knapsack problem, based on the networks of splicing processors with evaluation sets considered as problem solving devices, is also recalled. Finally, we discuss some open problems and possible directions for further research in this area.

show abstract

“…En este trabajo se ha realizado un estudio sobre un modelo inspirado en la biología celular denominado redes de procesadores evolutivos [55,53], esto es, redes cuyos nodos son procesadores muy simples capaces de realizar únicamente un tipo de mutación puntual (inserción, borrado o sustitución de un símbolo). Estos nodos están asociados con un filtro que está definido por alguna condición de contexto aleatorio o de pertenencia.…”

Section: Introductionunclassified

“…Como primer aporte significativo se ha propuesto una nueva dinámica de las redes de procesadores evolutivos con un comportamiento no determinista y masivamente paralelo [55], y por tanto todo el trabajo de investigación en el área de la redes de procesadores se puede trasladar a las redes masivamente paralelas. Por ejemplo, las redes masivamente paralelas se pueden modificar de acuerdo a determinadas reglas para mover los filtros hacia las conexiones.…”

Section: Introductionunclassified

Modelo de computación conexionista inspirado en las redes de procesadores evolutivos y su aprendizaje

Martínez¹

View full text Add to dashboard Cite

Implementation of Massive Parallel Networks of Evolutionary Processors (MPNEP): 3-Colorability Problem

Cited by 6 publications

References 4 publications

Networks of Polarized Evolutionary Processors Are Computationally Complete

Networks of Polarized Evolutionary Processors Are Computationally Complete

Polarization: a new communication protocol in networks of bio-inspired processors

Modelo de computación conexionista inspirado en las redes de procesadores evolutivos y su aprendizaje

Contact Info

Product

Resources

About