Deciding Networks of Evolutionary Processors
In this paper we discuss the usage of Accepting Networks of Evolutionary Processors (ANEPs for short) as deciding devices. In this context we define a new halting condition for this model, which seems more coherent with the rest of the theory than the previous such definition, and show that all the computability results reported so far remain valid in the new framework. Moreover, we give a direct and efficient simulation of an arbitrary ANEP by a complete ANEP, thus, showing that the efficiency of deciding a language by ANEPs is not influenced by the network’s topology. Finally, we obtain a surprising characterization of P NP[log] as the class of languages that can be decided in polynomial time by ANEPs.
KeywordsTuring Machine Output Node Consecutive Step Short Computation Communication Step
Unable to display preview. Download preview PDF.
- 1.Margenstern, M., Mitrana, V., Jesús Pérez-Jímenez, M.J.: Accepting Hybrid Networks of Evolutionary Processors. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) DNA 2004. LNCS, vol. 3384, pp. 235–246. Springer, Heidelberg (2005)Google Scholar
- 10.Manea, F.: Deciding networks of evolutionary processors. Technical report (2010), http://theo.cs.uni-magdeburg.de/pubs/preprints/pp-afl-2011-05.pdf
- 11.Manea, F.: Deciding according to the shortest computations. In: Normann, D. (ed.) CiE 2011. LNCS, vol. 6735, pp. 191–200. Springer, Heidelberg (2011)Google Scholar