The connection machine
Towards a new architecture for symbolic processing
AIICSR'94 Proceedings of the sixth international conference on Artificial intelligence and information-control systems of robots
Journal of Computer and System Sciences
Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Networks of Parallel Language Processors
New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)
Hybrid networks of evolutionary processors
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Hi-index | 0.00 |
In this paper we consider networks of evolutionary processors with splicing rules and forbidding context (NEPFS) as language generating and computational devices. Such a network consists of several processors placed on the nodes of a virtual graph and are able to perform splicing (which is a biologically motivated operation) on the words present in that node, according to the splicing rules present there. Before applying the splicing operation on words, we check for the absence of certain symbols (forbidding context) in the strings on which the rule is applied. Each node is associated with an input and output filter. When the filters are based on random context conditions, one gets the computational power of Turing machines with networks of size two. We also show how these networks can be used to solve NP–complete problems in linear time.