News for hackers. Stuff that matters.
Re:Stepping into math: Open-sourcing our step-by-step solver by 21 on Thursday January 19, 2017 @08:31PM (#13441076)
Why does it matter the complexity of the solution check?

If for some reason the counter example of the Reimann hyp would be checkable in exponential time (whatever that means), and if it would have required 10 years of computer time to check, how would that matter? The solution would still stand (assuming that everybody agrees that no mistake was made).

Re:Stepping into math: Open-sourcing our step-by-step solver by Ar-Curunir on Thursday January 19, 2017 @09:23PM (#13441316)
The question applies to the classroom setting we were talking about; teachers don't have access to supercomputers :P