|
2 | Inserted word "be". | ||
|
One measure of hardness might be how long it takes to write up a computer-checkable proof of the theorem in question. It took a few months for a colleague of mine to produce a completely formal proof of the prime number theorem, so in that sense it is still hard. The same goes for the Jordan curve theorem. As for the Riemann mapping theorem, I don't know that there is a computer-checkable proof yet. |
||||
|
|
1 | [made Community Wiki] | ||
|
One measure of hardness might how long it takes to write up a computer-checkable proof of the theorem in question. It took a few months for a colleague of mine to produce a completely formal proof of the prime number theorem, so in that sense it is still hard. The same goes for the Jordan curve theorem. As for the Riemann mapping theorem, I don't know that there is a computer-checkable proof yet. |
||||
