> If he says he has Riemann, well then, he has Riemann.
Well he said he doesn't even fully understand the proof (250k pages). So it's more like "If lean says he has Reimann, then we presume he has Reimann."
The best argument I've heard for lean being trustworthy is that different lean engines won't likely have the same bug. I guess what I'd like to see next is a list of every lean engine and its result for this?
And then if that passes, presumably the goal is simplifying down from 250k pages.
What I don't understand about Lean is how is it going to avoid writing statements that are no-ops?
How do we know all the lines in the proof aren't just gibberish?
Exactly, people are running these computations right now. You could as well. It will take several hours, though.
I don't have much of a math background but the author making such strong claims about a proof the author couldn't have possibly read seems absurd to me. What am I missing?