Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Evolutionary computation: toward a new philosophy of machine intelligence
Evolutionary computation: toward a new philosophy of machine intelligence
Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic algorithms + data structures = evolution programs (3rd ed.)
Swarm intelligence: from natural to artificial systems
Swarm intelligence: from natural to artificial systems
Swarm intelligence
Handbook of Evolutionary Computation
Handbook of Evolutionary Computation
Multi-Objective Optimization Using Evolutionary Algorithms
Multi-Objective Optimization Using Evolutionary Algorithms
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
A study of drift analysis for estimating computation time of evolutionary algorithms
Natural Computing: an international journal
How to Solve It: Modern Heuristics
How to Solve It: Modern Heuristics
Computational Realizations of Living Systems
Artificial Life
Universality for Turing Machines, Inductive Turing Machines and Evolutionary Algorithms
Fundamenta Informaticae - Machines, Computations and Universality, Part I
No free lunch theorems for optimization
IEEE Transactions on Evolutionary Computation
| Hi-index | 0.00 |
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!