A theory T(α) such that forall N, Sound(T+N) iff Busy_Beaver(N) < α.
-
-
-
Not possible for finite α, because if T+N is sound, then so is T+N+1.
End of conversation
New conversation -
-
-
This privilege escalation exploit is why I never trust any theory about integers.
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.