N ≤ 4888, it seems! http://www.scottaaronson.com/blog/?p=2725 https://twitter.com/qntm/status/644547639132966912 …
Note that S(7) is apparently more than 10^10^10^10^10^10^7, so S(4888) is probably a FAIRLY large number of steps to run for
-
-
@qntm full employment theorem for mathematicians right thereThanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
@qntm another way of looking at this is you can't calculate S(4888) until you've solved the Goldbach Conjecture one way or the other.Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.