busy beaver function

/B IH1 Z IY0 B IY0 V ER0 F AH0 NG K SH AH0 N/
noun
  1. 1

    (mathematics, computing theory) The mathematical function, denoted by Σ(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.

Translate “busy beaver function” into another language