-
This Tweet is unavailable.
It is the other way around. Gödel and Turing show that if you allow for proofs with infinitely many steps (i.e. try to use the result of a computation that does not terminate after finitely many steps) you run into contradictions, forcing us to discard noncomputational math.
10:41 AM - 3 May 2019
from Palo Alto, CA
0 replies
0 retweets
1 like
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.