Computational Intelligence, Proceedings of the World on Congress on (2002)
Honolulu, HI, USA
May 12, 2002 to May 17, 2002
E. Eberbach , Comput. & Inf. Sci. Dept, Massachusetts Univ., North Dartmouth, MA, USA
Evolutionary computation (EC) has traditionally been used for the solution of hard optimization problems. In the general case, solutions found by evolutionary algorithms are satisficing, given current resources and constraints, but not necessarily optimal. Under some conditions, evolutionary algorithms are guaranteed (in infinity) to find an optimal solution. However, evolutionary techniques are not only helpful for dealing with intractable problems. In this paper, we demonstrate, that EC is not restricted to algorithmic methods, and is more expressive than Turing machines.
E. Eberbach, "On expressiveness of evolutionary computation: is EC algorithmic?", Computational Intelligence, Proceedings of the World on Congress on, vol. 01, no. , pp. 564-569, 2002, doi:10.1109/CEC.2002.1006988