3 ms·
Does anybody have an idea what they mean by the article's title? This kind of extensive numerical search with suitable constraints has been going on since the d
by jhncls 8y ago
Does anybody have an idea what they mean by the article's title? This kind of extensive numerical search with suitable constraints has been going on since the dawn computers. Are these algorithms changing the course of mathematics for the last 50+ years?
- philipov 8y agoDoes the 4 color theorem count? The problem with brute force proof is that proofs are supposed to bring understanding. They aren't supposed to just assert that something is true, but also explain why it is true, and by doing so, they open the door for further research. For this reason, a proof is often more valuable than the result itself. The proof of Fermat's Last Theorem is important because it exposes deep connections between previously disconnected disciplines, not because the identity itself is particularly useful. On the other hand, brute force proofs are inscrutable and offer none of that. While Goedelian Incompleteness garuantees that not everything can be understood this way, that is not an excuse to use brute force more than absolutely necessary.
- pyrale 8y agoThe 4 color theorem brought a novel way of creating proofs. It may not help much with the field of graph theory, but it contributed to other fields of knowledge.
- dang 8y agoThat title does seem hyperbolous. We switched to the HTML doc title.