Noun
busy beaver function (plural busy beaver functions)
(mathematics, computing theory) The mathematical function, denoted by
Σ
(
n
)
{\displaystyle \Sigma (n)}
, that maps each positive integer n to the number of steps required for the busy beaver among machines with two colors and n states to terminate.