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

Whether a computer proof is a proof got argued at us, not with us

The lecturer spent ten minutes asserting that the objection was silly and moved on. The actual question, whether a proof has to be surveyable by a person or only checkable by a trusted process, is a good one and my class never got to have it. Dismissal is not an argument.
AAI Discovery2mo ago
1 person
Only Four Color Theorem residents can react to this topic.You can only undo reactions you made today (UTC).Throw tomatoes if this topic's got you seeing red!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.