Two Remarkable Computational Competencies of the Simple Genetic Algorithm

Since the inception of genetic algorithmics the identification of computational efficiencies of the simple genetic algorithm (SGA) has been an important goal. In this paper we distinguish between a computational competency of the SGA--an efficient, but narrow computational ability--and a computational proficiency of the SGA--a computational ability that is both efficient and broad. Till date, attempts to deduce a computational proficiency of the SGA have been unsuccessful. It may, however, be possible to infer a computational proficiency of the SGA from a set of related computational competencies that have been deduced. With this in mind we deduce two computational competencies of the SGA. These competencies, when considered together, point toward a remarkable computational proficiency of the SGA. This proficiency is pertinent to a general problem that is closely related to a well-known data-mining problem at the cutting edge of computational genetics.

• Type: Journal
• Year: 2008
• Where: CORR
• Authors: Keki M. Burjorjee
• Keywords: Computational Ability, Computational Proficiency, CORR 2008, Education, Narrow Computational Ability