We present an evolutionary algorithm that uses probability distributions for the solution of the Busy Beaver (BB) problem. The BB involves the representation of Turing Machines (TMs). Suppose a TM with a two way infinite tape and a tape alphabet = (blank, 1), the goal is to find the N-state halting TM that writes the maximum number of 1s when starts on a blank tape. This maximum number, which is function of the number of states, is denoted by sum(N) non-blank cells is called a Busy Beaver (BB).
展开▼
