The Busy Beaver numbers are how long a Turing Machine of some size can run and still halt. There are different ways of formulating them, but the most common is the number of steps a 2-symbol, N-state machine can run before halting. These numbers go 1, 6, 21, 107, 47176870.
The 6th number is already known to be higher than 10⇈15.
You must log in or # to comment.
Wasn’t sure where to post this; we don’t have a /c/math.