Abstract
We propose a computational model that is inspired by genetic operations over strings such as mutation and crossover. The model, Accepting Network of Genetic Processors, is highly related to previously proposed ones such as Networks of Evolutionary Processors and Networks of Splicing Processors. These models are complete computational models inspired by DNA evolution and recombination. Here, we prove that the proposed model is computationally complete (it is equivalent to the Turing machine). Hence, it can accept any recursively enumerable language. In addition, we relate the proposed model with (parallel) Genetic Algorithms or Evolutionary Programs and we set these techniques as decision problem solvers.
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.
