Hacker News new | ask | show | jobs
by VirusNewbie 1533 days ago
Very much so.
1 comments

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.