|
|
|
|
|
|
by pacala
3205 days ago
|
|
|
Another excellent point. Right now it's a "winner takes all" competition. It matters to prove a result, and much less to provide an "elegant" proof. I can only hope for a future where we measure the algorithmic entropy of a proof [log proof length][0], and results like "ABC theorem proof using half the bits as best known proof" become notable. [0] https://en.wikipedia.org/wiki/Kolmogorov_complexity |
|
|