
About:Theorem that four colors suffice to color any planar map without adjacent repeats.
Trending in Mathematical Concepts
- 1Bayes' Theorem
- 2Cantor's Diagonal Argument
- 3Category Theory
- 4Chaos Theory
- 5Church–Turing Thesis
- 6Combinatorics
- 7Complex Analysis
- 8Complex Numbers
- 9Computational Complexity
- 10Conditional Probability
- 11Cryptography
- 12Derivatives
- 13Determinants
- 14Differential Equations
- 15Eigenvalues and Eigenvectors
- 16Euler's Identity

About:Theorem that four colors suffice to color any planar map without adjacent repeats.
The formally verified version was mentioned as a footnote
A machine-checked version of the proof inside a proof assistant changes the shape of the objection: the worry moves from thousands of unread cases to the correctness of the assistant and the statement formalisation. That is a genuinely different discussion and it got one line. It deserved the same time as the original controversy.
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.