8 ms·Using Busy Beavers to prove conjectures1 points by jjgreen 3y agotromp 3y agoKnowledge of Busy Beaver numbers can (in principle only) decide any finitely refutable conjecture. But not others like Collatz' 3n+1 conjecture.