Incompleteness Ex Machina
Not on the map. Why?
Abstract (arXiv)
In this essay we'll prove G"odel's incompleteness theorems twice. First, we'll prove them the good old-fashioned way. Then we'll repeat the feat in the setting of computation. In the process we'll discover that G"odel's work, rightly viewed, needs to be split into two parts: the transport of computation into the arena of arithmetic on the one hand and the actual incompleteness theorems on the other. After we're done there will be cake.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). First posted on arXiv 6 Sep 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1.
1 paper.