TABLE OF CONTENTS Penousal Machado, ISEC, Portugal
Francisco B. Pereira, ISEC, Portugal
Jorge Tavares, CISUC, Portugal
Ernesto Costa, CISUC, Portugal
Am lcar Cardoso, CISUC, Portugal
In this chapter we study the feasibility of using Turing Machines as a model for the evolution of computer programs. To assess this idea we select, as test problem, the Busy Beaver a well-known theoretical problem of undisputed interest and difficulty proposed by Tibor Rado in 1962. We focus our research on representational issues and on the development of specific genetic operators, proposing alternative ways of encoding and manipulating Turing Machines. The results attained on a comprehensive set of experiments show that the proposed techniques bring significant performance improvements. Moreover, the use of a graph based crossover operator, in conjunction with new representation techniques, allowed us to establish new best candidates for the 6, 7, and 8 states instances of the 4-tuple Busy Beaver problem.
In 1937 Alan Turing, while trying to solve one of the problems posed by Hilbert, developed a theoretical computational model that became known as Turing Machines (Turing, 1937). According to the Church-Turing thesis, these finite state...
