A formal analysis of the computational dynamics in GIGANTEC.
Badr, Amr
Mathware and Soft Computing, Tome 8 (2001), p. 137-152 / Harvested from Biblioteca Digital de Matemáticas
Access to full text

An evolutionary algorithm formalism has been forwarded in a previous research, and implemented in the system GIGANTEC: Genetic Induction for General Analytical Non-numeric Task Evolution Compiler [Bad98][Bad99]. A dynamical model is developed to analyze the behaviour of the algorithm. The model is dependent in its analysis on classical Compilers Theory, Game Theory and Markov Chains and its convergence characteristics. The results conclude that a limiting state is reached, which is independent of the initial population and the mutation rate, but dependent on the cardinality of the alphabet of the driving L-system.

Publié le : 2001-01-01
DMLE-ID : 1961 
@article{urn:eudml:doc:39219,
     title = {A formal analysis of the computational dynamics in GIGANTEC.},
     journal = {Mathware and Soft Computing},
     volume = {8},
     year = {2001},
     pages = {137-152},
     zbl = {1014.68047},
     language = {en},
     url = {http://dml.mathdoc.fr/item/urn:eudml:doc:39219}
}

Badr, Amr. A formal analysis of the computational dynamics in GIGANTEC.. Mathware and Soft Computing, Tome 8 (2001) pp. 137-152. http://gdmltest.u-ga.fr/item/urn:eudml:doc:39219/