1) N-state Turing machine, halts on a Goldbach conjecture counter-example 2) Run for >S(N) steps https://en.wikipedia.org/wiki/Busy_beaver#Max_shifts_function … 3) Theorem proved
-
-
@qntm there's 1+1=2 I guessThanks. 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.