Hacker News new | ask | show | jobs
by uoaei 1540 days ago
...are you?
1 comments

Very much so.
So lording esoteric knowledge over the anonymous rabble is more productive than just explaining what is the issue?
ok fair enough. There is no issue with proving arithmetic consistency on a finite number of symbols. Incompleteness entirely relies on the unbounded induction step.