The Busy Beaver is an interesting theoretical problem proposed by Tibor Rado in 1962. Since then, it has attracted the attention of many researchers and several contests were organised trying to produce good solutions. In this paper, we propose an evolutionary approach to the problem. Our experimental results prove that this technique is very effective in attacking Busy Beaver, since we were able to find several Turing machines that outperform previous best?known solutions.
PDF File
Cited by
Year 2005 : 1 citations
Owen Kellet, A Multi-Faceted Attack On The Busy Beaver Problem, M.Sc. Thesis, Rensselaer Polytechnic Institute, Troy, New York, July 2005.
Year 2003 : 1 citations
S. Bringsjord, M. J. Zenzen. Superminds: People Harness Hypercomputation, and More. Kluwer Academic Publishers
Year 2002 : 3 citations
Alessandro Perrone and Gianluigi Ferraris "Alessandro Perrone and Gianluigi Ferraris" Intelligent Data Engineering and Automated Learning " IDEAL 2002, Lecture Notes in Computer Science, Volume 2412/2002, 2002.
Nattee Niparnan, A Genetic Algorithm for Finite State Machine
Inference, PhD Thesis, Chulalongkorn University, 2002.
Kyle Ross, Use of Optimisation Techniques in Determining Values for the Quadruplorum Variants of Rado’s Busy Beaver Function, MSc. Thesis, Rensselaer Polytechnic Institute (RPI) 2002.
