Saved in:
Bibliographic Details
Main Author: Eberbach, Eugene
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2411.15008
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914004693155840
author Eberbach, Eugene
author_facet Eberbach, Eugene
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2411_15008
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Evolutionary Automata and Deep Evolutionary Computation
Eberbach, Eugene
Neural and Evolutionary Computing
Computation and Language
68
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.
title Evolutionary Automata and Deep Evolutionary Computation
topic Neural and Evolutionary Computing
Computation and Language
68
url https://arxiv.org/abs/2411.15008