Probabilistic Evolution and the busy beaver Problem

Download: PDF.

“Probabilistic Evolution and the busy beaver Problem” by Roberto Santana, Francisco B. Pereira, Ernesto Costa, Alberto Ochoa, Penousal Machado, Amilcar Cardoso, and Marta Rosa Soto. In Late Breaking Papers at the 2000 Genetic and Evolutionary Computation Conference GECCO-2000, (Darrell Whitley, ed.), (Las Vegas, Nevada, USA), 8 July 2000, pp. 261-268.

Abstract

We discuss the use of probabilistic evolution in an important class of problems based on Turing Machines, namely the famous Busy Beaver. Despite the bad properties of this problem for a probabilistic solution: nonbinary representation and variable associations with a strongly connected graph-like structure, our algorithm seems to outperform previous evolutionary computation approaches.

Download: PDF.

BibTeX entry:

@inproceedings{Santana_et_al:2000,
   author = {Roberto Santana and Francisco B. Pereira and Ernesto Costa
	and Alberto Ochoa and Penousal Machado and Amilcar Cardoso and
	Marta Rosa Soto},
   editor = {Darrell Whitley},
   title = {Probabilistic Evolution and the busy beaver Problem},
   booktitle = {Late Breaking Papers at the 2000 Genetic and Evolutionary
	Computation Conference GECCO-2000},
   pages = {261--268},
   address = {Las Vegas, Nevada, USA},
   month = {8 July},
   year = {2000}
}

(This webpage was created with bibtex2web.)

Back to Roberto Santana publications.