Y
Hacker News
new
|
ask
|
show
|
jobs
by
uoaei
1534 days ago
So lording esoteric knowledge over the anonymous rabble is more productive than just explaining what is the issue?
1 comments
VirusNewbie
1534 days ago
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.
link