Home

The aim of this project is to find busy beavers using evolutional computing techniques on the transition tables of a population of Turing machines.

The problem is extremely difficult to solve since the number of Turing machines with N states on an alphabet of M symbols is huge; moreover this problem embeds the halting problem, since for evaluating a machine we need to execute it, and of course we don't know if and when it will eventually stop.

Our choices in the Turing machines implementation are detailed here.

Choices regarding the evolutionary computing tool can be found here.

Some information about the fitness function used in the genetic programming can be found here