## On Expressiveness of Evolutionary Computation: Is EC Algorithmic? (2002)

Venue: | Proc. 2002 World Congress on Computational Intelligence WCCI’2002 |

Citations: | 9 - 4 self |

### BibTeX

@INPROCEEDINGS{Eberbach02onexpressiveness,

author = {Eugene Eberbach},

title = {On Expressiveness of Evolutionary Computation: Is EC Algorithmic?},

booktitle = {Proc. 2002 World Congress on Computational Intelligence WCCI’2002},

year = {2002},

pages = {564--569}

}

### Years of Citing Articles

### OpenURL

### Abstract

Evolutionary Computation has been used traditionally for solution of hard optimization problems. In a general case, solutions found by evolutionary algorithms are satisficing given current resources and constraints, but not necessary optimal. Under some conditions evolutionary algorithms are guaranteed (in infinity) to find an optimal solution. However, evolutionary techniques are helpful not only to deal with intractable problems. In this paper we demonstrate, that EC is not restricted to algorithmic methods, and is more expressive than Turing Machines.

### Citations

4144 |
Introduction to Automata Theory, Languages, and Computation
- Hopcroft, Ullman
- 1979
(Show Context)
Citation Context ...d in terms of a Turing machine, is now known as the Church-Turing thesis. We use the simplicity of the TM model to prove formally that there are specific problems (languages) that the TM cannot solve =-=[10]-=-. Solving the problem is equivalent to decide whether a string belongs to the language. A problem that cannot be solved by computer (Turing machine) is called undecidable (TM-undecidable). The class o... |

1308 |
On computable numbers, with an application to the Entscheidungsproblem
- Turing
- 1936
(Show Context)
Citation Context ...ring Machine (TM) is considered a formal model of a (digital) computer running a particular program. The Turing Machine is the invention of Alan Turing, who introduced his a-machine in his 1936 paper =-=[13]-=- as a byproduct to show the unsolvability of the Hilbert's decision problem in mathematics to prove or disprove all mathematical statements. TM supposed to model any human solving algorithmically an a... |

954 | Genetic Programming
- Koza
- 1992
(Show Context)
Citation Context ...lgorithms, and $-calculus. In spite, of their name, evolutionary algorithms, in general, do not simplify problem to solve (excluding, perhaps, Genetic Programming with Automatically Defined Functions =-=[11]-=-). 3. Guessing: selecting randomly a path to find a solution. This approach is used by nondeterministic, probabilistic, randomized, ergodic, evolutionary algorithms, simulated annealing, random restar... |

691 |
Evolutionary Computation: Toward a New Philosophy of Machine Intelligence
- Fogel
- 1995
(Show Context)
Citation Context ... Evolutionary Algorithm and Evolutionary Turing Machines A generic Evolutionary Algorithm can be described in the form of the functional equation working in a simple iterative loop in discrete time t =-=[5]-=-: x[t + 1] = s(v(x[t])); where x - is a population under a representation (e.g., fixed binary strings for GAs, Finite State Machines for EP, parse trees for GP, vectors of reals for ES), s - is select... |

247 | Why Interaction Is More Powerful Than Algorithms
- Wegner
- 1997
(Show Context)
Citation Context ...dels have been presented, including Turing's o-machine (TM with oracles), c-machines (choice machines), u-machines (unorganized machines), cellular automata, neural networks [7], Interaction Machines =-=[14, 15]-=-, Persistent Turing Machines PTM, -calculus [12], $-calculus [2, 3]. In particular, Evolutionary Turing Machine can be understood as a special case of Persistent Turing Machines [8, 9] which preserve ... |

153 | Elements of interaction
- Milner
- 1993
(Show Context)
Citation Context ...ne (TM with oracles), c-machines (choice machines), u-machines (unorganized machines), cellular automata, neural networks [7], Interaction Machines [14, 15], Persistent Turing Machines PTM, -calculus =-=[12]-=-, $-calculus [2, 3]. In particular, Evolutionary Turing Machine can be understood as a special case of Persistent Turing Machines [8, 9] which preserve contents of the working tape to a new computatio... |

60 |
Models of Massive Parallelism: Analysis of Cellular Automata and Neural Networks (Springer-Verlag
- Garzon
- 1995
(Show Context)
Citation Context ...s. In [4], several such models have been presented, including Turing's o-machine (TM with oracles), c-machines (choice machines), u-machines (unorganized machines), cellular automata, neural networks =-=[7]-=-, Interaction Machines [14, 15], Persistent Turing Machines PTM, -calculus [12], $-calculus [2, 3]. In particular, Evolutionary Turing Machine can be understood as a special case of Persistent Turing ... |

27 | Persistent turing machines as a model of interactive computation
- Goldin
- 2000
(Show Context)
Citation Context ...tion Machines [14, 15], Persistent Turing Machines PTM, -calculus [12], $-calculus [2, 3]. In particular, Evolutionary Turing Machine can be understood as a special case of Persistent Turing Machines =-=[8, 9]-=- which preserve contents of the working tape to a new computation (in ETM results of one generation, are used in the next generation) Such models derive their higher than TM expressiveness using three... |

17 | Calculus Bounded Rationality = Process Algebra + Anytime Algorithms
- Eberbach
- 2001
(Show Context)
Citation Context ...es), c-machines (choice machines), u-machines (unorganized machines), cellular automata, neural networks [7], Interaction Machines [14, 15], Persistent Turing Machines PTM, -calculus [12], $-calculus =-=[2, 3]-=-. In particular, Evolutionary Turing Machine can be understood as a special case of Persistent Turing Machines [8, 9] which preserve contents of the working tape to a new computation (in ETM results o... |

6 | Evolutionary Computation as a Multi-Agent Search: A $-Calculus Perspective for its Completeness and Optimality
- Eberbach
(Show Context)
Citation Context ...es), c-machines (choice machines), u-machines (unorganized machines), cellular automata, neural networks [7], Interaction Machines [14, 15], Persistent Turing Machines PTM, -calculus [12], $-calculus =-=[2, 3]-=-. In particular, Evolutionary Turing Machine can be understood as a special case of Persistent Turing Machines [8, 9] which preserve contents of the working tape to a new computation (in ETM results o... |