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 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
-
-
@zarawesome And whether there are any theorems provable using 4 states -
@qntm there's 1+1=2 I guess
End of conversation
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.