Abstract
The Busy Beaver is an interesting theoretical problem proposed by Rado in 1962, in the context of the existence of non computable functions. 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, designed to take advantage of the existence of sets of equivalent Turing Machines. The experimental results show that these alternatives provide improvement over the “standard” genetic codification.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Boolos, G., and Jeffrey, R. (1995). Computability and Logic, Cambridge University Press.
Goodman, E. (1996). GALOPPS (Release 3.2-July, 1996), The Genetic Algorithm Optimized for Portability and Parallelism System, Technical Report #96-07-01, Michigan State University.
Holland, J. (1975) Adaptation in Natural and Artificial Systems, Univ. of Michigan Press.
Jones, T., Rawlins, G. (1993) Reverse HillClimbing, Genetic Algorithms and the Busy Beaver Problem, In Forrest, S. (Ed.), Genetic Algorithms: Proceedings of the Fifth International Conference (ICGA-93). San Mateo, CA: Morgan Kaufmann, pp 70–75.
Lally, A., Reineke, J., and Weader, J. (1997). An Abstract Representation of Busy Beaver Candidate Turing Machines.
Marxen, H. Buntrock, J. (1990). Attacking Busy Beaver 5, Bulletin of the European Association for Theorethical Computer Science, Vol 40.
Pereira, F. B., Machado, P., Costa, E. and Cardoso, A. (1999). Busy Beaver: An Evolutionary Approach. To be published in the Proceedings of the 2 nd Symposium on Artificial Intelligence (CIMAF-99), Havana, Cuba.
Rado, T. (1962) On non-computable functions, The Bell System Technical Journal, vol. 41, no. 3, pp.877–884.
Wood, D. (1987). Theory of Computation, Harper & Row, Publishers.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Machado, P., Pereira, F.B., Cardoso, A., Costa, E. (1999). Busy Beaver - The Influence of Representation. In: Poli, R., Nordin, P., Langdon, W.B., Fogarty, T.C. (eds) Genetic Programming. EuroGP 1999. Lecture Notes in Computer Science, vol 1598. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48885-5_3
Download citation
DOI: https://doi.org/10.1007/3-540-48885-5_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65899-3
Online ISBN: 978-3-540-48885-9
eBook Packages: Springer Book Archive