Re:The Boundary of Computation: Busy Beaver (video)
by tromp on Thursday July 13, 2023 @04:16AM
(#36706321)
A functional (lambda calculus based) equivalent [1] of the traditional Busy Beaver function is more fine-grained as it's a function of number of bits rather than number of states.
It also appears to grow faster bit-for-bit as argued in [2].
[1] https://oeis.org/A333479
[2] https://googology.fandom.com/wiki/User_blog:JohnTromp/The_la...