Evolutionary automata as foundation of evolutionary computation: Larry Fogel was right

@article{Eberbach2009EvolutionaryAA,
  title={Evolutionary automata as foundation of evolutionary computation: Larry Fogel was right},
  author={E. Eberbach and M. Burgin},
  journal={2009 IEEE Congress on Evolutionary Computation},
  year={2009},
  pages={2149-2156}
}
In this paper we study expressiveness of evolutionary computation. To do so we introduce evolutionary automata and define their several subclasses. To our surprise, we got the result that evolving finite automata by finite automata leads outside its class, and allows to express for example pushdown automata or Turing machines. This explains partially why Larry Fogel restricted representation in Evolutionary Programming to finite state machines only. The power of evolution is enormous indeed! 
Evolutionary Automata: Expressiveness and Convergence of Evolutionary Computation
Recursively Generated Evolutionary Turing Machines and Evolutionary Automata
  • M. Burgin, E. Eberbach
  • Computer Science
  • Artificial Intelligence, Evolutionary Computing and Metaheuristics
  • 2013
Bounded and periodic evolutionary machines
Inductive Turing Machines

References

SHOWING 1-10 OF 38 REFERENCES
On Foundations of Evolutionary Computation: An Evolutionary Automata Approach
Cooperative combinatorial optimization: Evolutionary computation case study
An Introduction to Automata Theory
Evolution of evolution: Self-constructing Evolutionary Turing Machine case study
Toward a theory of evolutionary computation.
An Efficient Computation of the Equation K-automaton of a Regular K-expression
Evolutionary computation: Toward a new philosophy of machine intelligence
Evolutionary Computation: Towards a New Philosophy of Machine Intelligence
...
1
2
3
4
...