For sufficiently large n, BusyBeaver of n+1, is at least the square of Busy Beaver of n. Proven by Jan, 1, 2051.

Created by JoshuaZ 12 days ago; known on 2051-01-01

Please log in to respond to or judge prediction