Assertion: busy beaver | /r/CapableOf | attain maximum operational busyness
Facets:
Source sentences:
text: In computability theory, a busy beaver (from the colloquial expression for "industrious person") is a Turing machine that attains the maximum "operational busyness" (such as measured by the number of steps performed, or the number of nonblank symbols finally on the tape) among all the Turing machines in a certain class.