Welcome to the InfoSci Platform
Evolutionary Turing Machines: The Quest for Busy Beavers

Evolutionary Turing Machines: The Quest for Busy Beavers

Penousal Machado, Francisco B. Pereira, Jorge Tavares, Ernesto Costa, Amílcar Cardoso
Copyright: © 2005 |Pages: 32
ISBN13: 9781591403128|ISBN10: 159140312X|ISBN13 Softcover: 9781591403135|EISBN13: 9781591403142
DOI: 10.4018/978-1-59140-312-8.ch002
Cite Chapter Cite Chapter

MLA

Machado, Penousal, et al. "Evolutionary Turing Machines: The Quest for Busy Beavers." Recent Developments in Biologically Inspired Computing, edited by Leandro Nunes de Castro and Fernando J. Von Zuben, IGI Global, 2005, pp. 9-40. https://doi.org/10.4018/978-1-59140-312-8.ch002

APA

Machado, P., Pereira, F. B., Tavares, J., Costa, E., & Cardoso, A. (2005). Evolutionary Turing Machines: The Quest for Busy Beavers. In L. Nunes de Castro & F. Von Zuben (Eds.), Recent Developments in Biologically Inspired Computing (pp. 9-40). IGI Global. https://doi.org/10.4018/978-1-59140-312-8.ch002

Chicago

Machado, Penousal, et al. "Evolutionary Turing Machines: The Quest for Busy Beavers." In Recent Developments in Biologically Inspired Computing, edited by Leandro Nunes de Castro and Fernando J. Von Zuben, 9-40. Hershey, PA: IGI Global, 2005. https://doi.org/10.4018/978-1-59140-312-8.ch002

Export Reference

Mendeley
Favorite

Abstract

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.