4 ms·
Counterexample: The Four Color Theorem (which states that any 2-dimensional map can be colored with four colors such that no two bordering countries have the sa
by xamuel 9y ago
Counterexample: The Four Color Theorem (which states that any 2-dimensional map can be colored with four colors such that no two bordering countries have the same color). It is considered proven even though the proof involves a giant computer verification which certainly can't be explained in under 100s of hours.
- ewrcoffee 9y agoI would expect one can reason about the program of the proof in less than 100 hours, which is essentially the proof.
- wolfgke 9y ago> Counterexample: The Four Color Theorem (which states that any 2-dimensional map can be colored with four colors such that no two bordering countries have the same color). It is considered proven even though the proof involves a giant computer verification which certainly can't be explained in under 100s of hours. There exists a proof of the Four Color Theorem by Georges Gonthier that has been verified in Coq: > https://www.ams.org/notices/200811/tx081101382p.pdf https://www.ams.org/notices/200811/tx081101382p.pdf > http://www.cse.chalmers.se/edu/year/2015/course/DAT140/Gonthier.pdf http://www.cse.chalmers.se/edu/year/2015/course/DAT140/Gonth... > https://mathoverflow.net/a/164949/12546 https://mathoverflow.net/a/164949/12546