busy beaver function

Computing, Computing theory, Engineering, Mathematics, Natural sciences, Physical sciences, Sciences 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.