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 @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.