Hacker News new | past | comments | ask | show | jobs | submit login

> The Four Colour Theorem is true because there exists a finite set of unavoidable yet reducible configurations. QED.

You just summarised (nearly) everything a mathematician can get out of that computerised proof. That's unsatisfying. It doesn't give you any insight into any other areas of math, nor does it suggest interesting corollaries, nor does it tell you which pre-condition of the statement does what work.

That's rather underwhelming. That's less than you can get out of the 100th proof of Pythagoras.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: