Abstract
The Random PROLOG Processor (RPP) is an abstract model for logical computations based on the concept ofinformation_moleculesquasi-randomly traveling and inferring in abstractcomputational_space. The simulated process or problem is defined in terms of PROLOG clauses (or sets of clauses encapsulated by membranes) seeded into the RPP by the programmer as a program. During the computational process,information_moleculesmove about, rendezvous, exchange internal information, modify themselves, assert otherinformation_molecules(or are retracted), disintegrate, or expire. Computations are unification-based logical inferences. In the RPP, the computations are parallel, randomly evolving processes. The RPP exhibits some properties of the DNA-computer, but can be considered for any computational environment. The RPP is proposed as a promising tool for parallel evolutionary computing, because PROLOG is a widely known, powerful language; because prices of multiprocessor architectures are falling sharply; and because parallel RPP implementation is easy. Since they are declarative and nondeterministic, RPP programs are extremely short. This paper presents the structure of the RPP application for parallel Evolutionary Computations with different types of problems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
