A formal analisys of the computational dynamics in GIGANTEC
PublisherUniversitat Politècnica de Catalunya. Secció de Matemàtiques i Informàtica
Rights accessOpen Access
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.