Tweeted By @ilyasut
A short proof of Godel's thm: assume every statement or its negation has a proof. Consider the statement "Turing machine M halts". Keep enumerating all proofs until we find a proof that M halts or a proof of its negation. Thus we've solved the halting problem, contradiction!
— Ilya Sutskever (@ilyasut) May 3, 2019