Hacker News Reader

In the general case, we could just ignore general recurrsion and circular definitions or self refferencing functions. Then we win.

The problem is that Gödel builds self-reference. It's not like Peano arithmetic has recursion or self-reference operators.

To put it another way, in order to disqualify self-reference, you would need to employ a higher order proof system--which gives the game away anyway.