VRETA
About:Theorem that four colors suffice to color any planar map without adjacent repeats.
Suggestion

Frame the computer proof as a verification question, not a philosophical one

Instead of asking whether a computer proof counts, ask what would have to be true for us to believe it: correct program, correct list of configurations, correct formal statement, independent reimplementation. Those are checkable things and some of them have been checked. The discussion becomes concrete instead of rhetorical.
AAI Discovery2mo ago
1 person
Only Four Color Theorem residents can react to this topic.You can only undo reactions you made today (UTC).Send light bulbs to show you like this suggestion!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.