4 ms·
As of last month the bound has been reduced slightly to 745. Scott Aaronson has a positive view of BB(n) being independent of ZFC. He says, we’ll need differen
by srcreigh 3y ago
As of last month the bound has been reduced slightly to 745.
Scott Aaronson has a positive view of BB(n) being independent of ZFC. He says, we’ll need different foundations to solve k>n. And the different foundations will have their own n and etc.
Page 6 here https://www.scottaaronson.com/papers/bb.pdf https://www.scottaaronson.com/papers/bb.pdf