4 ms·
Knowledge of Busy Beaver numbers can (in principle only) decide any finitely refutable conjecture. But not others like Collatz' 3n+1 conjecture.
by tromp 3y ago
Knowledge of Busy Beaver numbers can (in principle only) decide any finitely refutable conjecture. But not others like Collatz' 3n+1 conjecture.