But that complicated proof could be concisely provided via a universal proof algorithm and the statement of the four color theorem.
Exactly! The Kolmogorov complexity is not very high.
But that complicated proof could be concisely provided via a universal proof algorithm and the statement of the four color theorem.
Exactly! The Kolmogorov complexity is not very high.