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
- JoshuaZ estimated 64% 12 days ago
- JoshuaZ said “Weaker version of Conjecture 13 from here https://www.scottaaronson.com/papers/bb.pdf . ” 12 days ago
Please log in to respond to or judge prediction