In theoretical computer science, the objective of the busy beaver is to find a terminating program of a given size that (depending on definition) either produces the most output possible, denoted by BB(n), or runs for the longest number of steps.
The latest value for n = 5 was recently discovered.
The known values are BB(1) = 1, BB(2) = 6, BB(3) = 21, BB(4) = 107, BB(5) = 47,176,870.
Click here for more information.
Saturday, April 05, 2025
Subscribe to:
Posts (Atom)
