Busy beaver function ($BB(n)$)

$BB(n)$ is the largest number of 1's written by a halting $n$-state Turing machine on a tape initially filled with 0's.