Re:An ABC proof too tough even for mathematicians
by Evbn on Sunday November 25, 2012 @08:39PM
(#4829995)
Gödel's theorems are about uncountable infinities of statements, and statements whose meaning proof is outside the bounds of a theory. Nothing contradicts the possibility of an algorithm as good as as any human doing formal math.
[ Parent
| on HN ]
There are no comments on this comment yet.