Evolutionary Automata and Deep Evolutionary Computation

TL;DR

This paper introduces evolutionary automata as a formal model of evolutionary computation, offering a more comprehensive and expressive framework that parallels the formalism of automata theory and models natural evolution.

Contribution

It presents evolutionary automata as an advanced, dual formal model of evolutionary computation, enabling direct modeling of evolution of evolution with high expressiveness.

Findings

Evolutionary automata provide a more complete dual model of evolutionary computation.

The model allows for infinite generations and direct evolution of evolution.

Highlights the power of natural evolution through interactive feedback.

Abstract

Evolution by natural selection, which is one of the most compelling themes of modern science, brought forth evolutionary algorithms and evolutionary computation, applying mechanisms of evolution in nature to various problems solved by computers. In this paper we concentrate on evolutionary automata that constitute an analogous model of evolutionary computation compared to well-known evolutionary algorithms. Evolutionary automata provide a more complete dual model of evolutionary computation, similar like abstract automata (e.g., Turing machines) form a more formal and precise model compared to recursive algorithms and their subset - evolutionary algorithms. An evolutionary automaton is an automaton that evolves performing evolutionary computation perhaps using an infinite number of generations. This model allows for a direct modeling evolution of evolution, and leads to tremendous expressiveness of evolutionary automata and evolutionary computation. This also gives the hint to the power of natural evolution that is self-evolving by interactive feedback with the environment.