busy beaver

     

In computability theory, a busy beaver (from the colloquial expression for "inustrious person") is a Turing machine which, when given an empty tape, does a lot of work, then halts. The machine pushes limits on the amount of time and space resources that a halting Turing machine of similar sizes can consume.

Found pages about busy beaver