Networks of picture processors as problem solvers

Bordihn, Henning; Bottoni, Paolo; Labella, Anna; Mitrana, Víctor

doi:10.1007/s00500-016-2206-y

Cited by 3 publications

(4 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this section, we introduce the network of picture processors with evaluation sets (NPPES) proposed model. First, we start off by summarizing the notions used throughout this paper, which were previously introduced in [7]. This is the theoretical background underlying our proposed model.…”

Section: Network Picture Processors With Filtering By Evaluation Setsmentioning

confidence: 99%

“…We use the rewriting operations or evolutionary rules such as they are introduced and used in [6,7]. Concretely, we use substitution, mask and unmask rules.…”

Section: Preliminary Conceptsmentioning

confidence: 99%

“…We summarize the definitions of these rules below. In order to know the rest of rules (insertion and deletion) as well as the formal definitions for all evolutionary rules, we refer the reader to [7].…”

Section: Preliminary Conceptsmentioning

confidence: 99%

“…Particularly, networks of picture processors (NPP) [4,6,7] is a specialized model for computing two-dimensional strings, called pictures. There, a picture is a two-dimensional array of elements belonging a finite set of symbols (alphabet).…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Networks of Picture Processors with Filtering Based on Evaluation Sets as Solvers for Cryptographic Puzzles Based on Random Multivariate Quadratic Equations

et al. 2020

View full text Add to dashboard Cite

Networks of picture processors is a massively distributed and parallel computational model inspired by the evolutionary cellular processes, which offers efficient solutions for NP-complete problems. This bio-inspired model computes two-dimensional strings (pictures) using simple rewriting rules (evolutionary operations). The functioning of this model mimics a community of cells (pictures) that are evolving according to these bio-operations via a selection process that filters valid surviving cells. In this paper, we propose an extension of this model that empowers it with a flexible method that selects the processed pictures based on a quantitative evaluation of its content. In order to show the versatility of this extension, we introduce a solver for a cryptographic proof-of-work based on the hardness of finding a solution to a set of random quadratic equations over the finite field F2. This problem is demonstrated to be NP-hard, even with quadratic polynomials over the field F2, when the number of equations and the number of variables are of roughly the same size. The proposed solution runs in O(n2) computational steps for any size (n,m) of the input pictures. In this context, this paper opens up a wide field of research that looks for theoretical and practical solutions of cryptographic problems via software/hardware implementations based on bio-inspired computational models.

show abstract

Section: Network Picture Processors With Filtering By Evaluation Setsmentioning

confidence: 99%

“…We use the rewriting operations or evolutionary rules such as they are introduced and used in [6,7]. Concretely, we use substitution, mask and unmask rules.…”

Section: Preliminary Conceptsmentioning

confidence: 99%

Section: Preliminary Conceptsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Networks of Picture Processors with Filtering Based on Evaluation Sets as Solvers for Cryptographic Puzzles Based on Random Multivariate Quadratic Equations

et al. 2020

View full text Add to dashboard Cite

show abstract

Networks of polarized splicing processors as problem solvers

Negru

2019

Biosystems

View full text Add to dashboard Cite

Universality of SNQ P Systems Using One Type of Spikes and Restrictive Rule Application

Păun

Bîlbîe

2020

Int. J. Found. Comput. Sci.

View full text Add to dashboard Cite

We investigate the spiking neural P systems with communication on request (SNQ P systems) that are devices in the area of neural like P systems abstracting the way in which neurons work and process information. Here we discuss the SNQ P systems using the rule application strategy as defined by Linqiang Pan and collaborators and we are able to improve their result of universality of such systems using two types of spikes. In the current work, we prove that only one type of spikes is sufficient for reaching the computational power of Turing Machines for these devices, bringing closer to implementation such a device. The result holds both in maximum parallel manner application of the rules as well as the maximum-sequentiality application of rules.

show abstract

Networks of picture processors as problem solvers

Cited by 3 publications

References 17 publications

Networks of Picture Processors with Filtering Based on Evaluation Sets as Solvers for Cryptographic Puzzles Based on Random Multivariate Quadratic Equations

Networks of Picture Processors with Filtering Based on Evaluation Sets as Solvers for Cryptographic Puzzles Based on Random Multivariate Quadratic Equations

Networks of polarized splicing processors as problem solvers

Universality of SNQ P Systems Using One Type of Spikes and Restrictive Rule Application

Contact Info

Product

Resources

About