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 except to calculate the busy beaver number for that machine size, you'd have to run that machine on the first place
@zarawesome Exactly, computing S(N) is equivalent to solving the Goldbach conjecture AND all "equivalent complexity" problems simultaneously
-
-
@qntm well, let's get to it -
@zarawesome To my mind the interesting question is how many states a Turing machine requires to prove any given theorem - 2 more replies
New conversation -
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.