2 ms·
I’m not claiming anything about the correctness of this proof, but if it isn’t correct, writing a program that implements the algorithm would be a waste of time
by Someone 6y ago
I’m not claiming anything about the correctness of this proof, but if it isn’t correct, writing a program that implements the algorithm would be a waste of time.
So, if the proof is hard to follow and describes a complex algorithm, grad students who don’t fully grok the supposed proof might not be that happy to work on that program. They might end up looking for a nonexistent bug in their program for months.
I also think it’s illustrative to mention the Grothendieck prime (https://en.wikipedia.org/wiki/57_(number) https://en.wikipedia.org/wiki/57_(number)) here, as an example of how little concern some mathematicians have for applications of their results. That _could_ explain why Schnorr didn’t bother to even ask his students to write that program.