We discuss the use of evolutionary algorithms for solving problems in combinatorial group theory, using a class of equations in free groups as a test bench. We find that, in this context, there seems to be a correlation between successful evolutionary algorithms and the existence of good deterministic algorithms. We also trace the convergence of co-evolution of the population of fitness functions to a deterministic solution. © Springer-Verlag 2004.
CITATION STYLE
Booth, R. F., & Borovik, A. V. (2004). Coevolution of algorithms and deterministic solution of equations in free groups. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3003, 11–22. https://doi.org/10.1007/978-3-540-24650-3_2
Mendeley helps you to discover research relevant for your work.