A formal analysis of the computational dynamics in GIGANTEC

• Autores: Amr Badr
• Localización: Mathware & soft computing: The Magazine of the European Society for Fuzzy Logic and Technology, ISSN-e 1134-5632, Vol. 8, Nº. 2, 2001, págs. 137-152
• Idioma: inglés
• Títulos paralelos:
  • Análisis formal de la dinámica computacional en GIGANTEC
• Enlaces
  • Texto completo (pdf)
• Resumen

  • 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.