A functional (lambda calculus based) equivalent [1] of the traditional Busy Beaver function is more fine-grained as a function of number of bits rather than num

A functional (lambda calculus based) equivalent [1] of the traditional Busy Beaver function is more fine-grained as a function of number of bits rather than number of states, and appears to grow faster bit-for-bit as argued in [2]. [1] https://oeis.org/A333479 https://oeis.org/A333479 [2] https://googology.fandom.com/wiki/User_blog:JohnTromp/The_largest_number_representable_in_64_bits https://googology.fandom.com/wiki/User_blog:JohnTromp/The_la...