A busy beaver is a Turing machine that runs for more steps than any other machine (having the same state machine size) but eventually halts (rather than looping

A busy beaver is a Turing machine that runs for more steps than any other machine (having the same state machine size) but eventually halts (rather than looping forever). The busy beaver function measures the run times of all busy beavers, the maximum number of steps you can get out of each state machine size. Apparently Radó proved this value eventually grows larger than any computable function. http://en.wikipedia.org/wiki/Busy_beaver#Non-computability_of_.CE.A3 http://en.wikipedia.org/wiki/Busy_beaver#Non-computability_o...