Towards Probabilistic Networks of Polarized Evolutionary Processors

The aim of this paper is to discuss two possible ways of introducing some features based on probabilistic concepts and methods in networks of polarized evolutionary processors (NPEP). We associate probabilities with rules in every node such that together with the communication protocol, which is based on the compatibility between the polarization of each node and data navigating through the network, might facilitate the study of biological phenomena as well as software simulations or hardware implementations. The probability associated with rules may be a priori defined and fixed or may be computed dynamically. Probabilities will also appear when communicating data between nodes; these probabilities may be statically or dynamically defined. This note also proposes the study of the impact of these characteristics and see how these new features reduce the gap between the formal model and its practical applicability. Introducing probabilities in NPEP is aimed to decrease the exponential expansion of the number of strings which appear in the computations used to solve NP-problems in a polynomial time. A decreasing of the exponential expansion of this number is achieved with a loss of certainty of the final result which is reached with some error probability.