News for hackers. Stuff that matters.
Re:Every odd number greater than five is the sum of three pr... by lmm on Tuesday May 14, 2013 @09:50AM (#5704780)
The four-colour theorem is a good example of a simple result which doesn't have a "natural" explanation - the only known proof is a computerized check of hundreds of cases. I remember Imre Leader saying some people think it's just an "accident of nature", that doesn't "mean" anything (insofar as any mathematics has meaning).

Oddly enough that doesn't bother me; in fact, it seems natural that some parts of mathematics are just "like that" with no underlying reason. It makes the world of mathematics seem all the richer if not all things are simple and logical consequences of other things.

Re:Every odd number greater than five is the sum of three pr... by ColinWright on Tuesday May 14, 2013 @10:05AM (#5704873)
Exactly so. For the record, Imre is one of my PhD siblings, and it's perfectly reasonable that we came to this point of view as a by-product of working with our supervisor (and "grandparents", Erdős and Adams)
Re:Every odd number greater than five is the sum of three pr... by scott_s on Tuesday May 14, 2013 @10:30AM (#5705066)
Colin, on days like this, I'm very glad you have not given up on HN entirely.
Re:Every odd number greater than five is the sum of three pr... by tikhonj on Tuesday May 14, 2013 @01:02PM (#5706249)
To me, that feels more like a limit on human cognition than a fundamental quality of the proof or the program. After all, you can summarize--or, perhaps compress--the proof into a program which checks the cases. It's simply a level removed from how mathematicians normally work.

On the other hand, if a proof could not be reduced at all--and, given my very limited understanding of information theory, this is possible--then I would certainly agree that it's inherently more complex.

Put another way, I think that using a computer to check cases like this is morally similar to using induction. It still exposes and exploits a certain simplicity in the domain.

Re:Every odd number greater than five is the sum of three pr... by lmm on Tuesday May 14, 2013 @03:30PM (#5707437)
There was no induction; the proof was essentially: a) all planar graphs can be reduced to these several hundred cases (this part is ordinary mathematics) b) observe that it's possible to four-colour each of these several hundred cases (and a computer program was used to verify it). To my mind the proof is as complex as that set of cases; the fact that we can write a relatively simple program to check them all doesn't really reduce the complexity or tell us anything about why they're all 4-colourable, in the same way that using a computer to check the riemann hypothesis up to some limit tells us nothing about why it holds.
Re:Every odd number greater than five is the sum of three pr... by tikhonj on Tuesday May 14, 2013 @03:57PM (#5707609)
I know it was not induction. My point is that a computer program to consider all the cases is just another mathematical tool morally similar to induction.

The program does tell us something, namely that the problem can be reduced to a bunch of similar cases all of which are colorable. The difference is that the insight is perhaps a level removed from a normal proof.

Essentially, I think that it's the program and not its output that plays the philosophical role of the proof in this case.

Of course, my perception is significantly colored by the fact that I'm mainly interested in programming languages rather than traditional math :P.

Re:Every odd number greater than five is the sum of three pr... by Fargren on Tuesday May 14, 2013 @11:11AM (#5705390)
For problems like that, I can't help but wonder if some day we'll discover that we are just not searching for the solution in the proper "language". Maybe some day someone will find a problem isomorphic the the for-color problem in a different field, and that problem will have a simple and natural explanation. Probably in a field we don't know today.