- author = "Penousal Machado and Francisco B. Pereira and Amilcar Cardoso and Ernesto Costa",
- title = "Busy Beaver -- the Influence of Representation",
- booktitle = "Genetic Programming, Proceedings of EuroGP'99",
- year = "1999",
- editor = "Riccardo Poli and Peter Nordin and William B. Langdon and Terence C. Fogarty",
- volume = "1598",
- series = "LNCS",
- pages = "29--38",
- address = "Goteborg, Sweden",
- publisher_address = "Berlin",
- month = "26-27 " # may,
- organisation = "EvoNet",
- publisher = "Springer-Verlag",
- keywords = "genetic algorithms, genetic programming",
- ISBN = "3-540-65899-8",
-
URL = "
http://cisuc.dei.uc.pt/ecos/dlfile.php?fn=135_pub_eurogp99.pdf",
-
DOI = "
doi:10.1007/3-540-48885-5_3",
- abstract = "The Busy Beaver is an interesting theoretical problem proposed by Rado in 1962. In this paper we propose an evolutionary approach to this problem. We will focus on the representational issues, proposing alternative ways of codifying and interpreting Turing Machines. These alternative representations take advantage of the existence of equivalent Turing machine sets. The experimental results show that the proposed representations provide improvement over the standard genetic codification.",
-
notes = "EuroGP'99, part of \cite{poli:1999:GP}
Penousal Machado won special jury prize.
Busy beaver = Turing machine which generates longest pattern of 1s and terminates. Solutions only known for very small Turing machines.",
