Busy-Beaver Function

computation

Definition

Busy-Beaver Function

$BB(n)$ is the maximum number of $1$s that a Turing machine with $n$ states and tape alphabet $\Gamma =\{B,1\}$, when started on the blank tape, leaves on the tape upon termination.

Computability

$BB$ is incomputable, and thus not Turing-computable.