Re:One-sentence proof of Fermat's theorem on sums of two squ...
by philtar on Tuesday July 26, 2016 @04:07PM
(#12168402)
Isn't computational complexity the terminology you're looking for?
[ Parent
| on HN ]
Re:One-sentence proof of Fermat's theorem on sums of two squ...
by fmap on Tuesday July 26, 2016 @04:27PM
(#12168525)
Yes, this is a good idea. What I'm concerned about is that there is no standard terminology. The paper - and another comment in here! - is talking about the proof being "non-constructive", when in reality it is a constructive proof in 2-EXPTIME.
I'm only nitpicking here, because I'm seeing this a lot...
Re:One-sentence proof of Fermat's theorem on sums of two squ...
by gohrt on Tuesday July 26, 2016 @05:32PM
(#12168879)
By your definition, what's an example of a non-constructive proof (of any theorem ) ?
Re:One-sentence proof of Fermat's theorem on sums of two squ...
by fmap on Tuesday July 26, 2016 @05:45PM
(#12168951)
Any proof using an instance of excluded middle or choice which is not constructively valid. For example, see the first proof on this page: http://www.cut-the-knot.org/do_you_know/irrat.shtml