@NachoAMDG@Matt95261@BrunsJulian1541 I'm doing more than that. I've pulled lean itself and I'm in the midst of validating it. I'm a systems engineer so I plan to be thorough. I'll happily change my mind but I plan to come in adversarially to break the tool. Either way I'll publish my results. Stay tuned.
@JohnHartfordOhm@Matt95261@BrunsJulian1541 Next goal post?
All I'm asking is how you, specifically, @JohnHartfordOhm independently verified the validity of lean before accepting the result of RH. Can you point me to the work you did? The paper that convinced you?
Or are you just blowing with the wind?
@PoodleSkirt2@Matt95261@BrunsJulian1541 How about you?
Can you share how you independently verified the validity of lean? Or are you too just accepting it on someone else's say so?
You may just want to sit this one out.
@etubruton@dohewater@grok Yeah well I have an extensive background in systems programming and I intend to exhaust lean's capabilities starting to do. If it turns out to be as robust as people proclaim I'll change my mind. Either way I'll publish my findings. Stay tuned.
@Matt95261@BrunsJulian1541 Enlighten me Matt.
What specifically did you do to verify that lean works as you expect?
Anything at all? If not, just sit this one out.
@chrislciaba Here's an informal breakdown of the odds with the light of RH being solved.
Finding a valid solution to P vs NP: <1%
That solution being P != NP: >99%
The chances of us proving that P = NP are immensely small.
I'd say it's most likely P ≠ NP based on existing literature and my own personal research. The proof itself has some notoriously challenging barriers that typical problems simply don't have.
Trying to show it computationally runs into a gnarly combinatorial explosion fairly quickly.
SAT solvers are fascinating for digging further in. They've done a lot to map out the problem space.
To be clear, I'd be happy to welcome a genuine solution to RH. This might be it, even if it's a bit AI-sloppy. I plan to put together my own Lean verifier to see if I can break some of the things it claims to promise. I'm just the kind of person who has to see for myself. If Lean turns out to be what people claim it is, I'll change my mind.
This is an overstatement.
First of all, most of the literature concurs that P != NP is most likely. In which case nothing really changes, whereas with RH, most of the literature believed it was true but couldn't prove it.
Most likely we never see a proof because there are real major theoretical barriers. It can't be brute-forced like RH. I personally believe a solution to P vs. NP is computationally intractable.
The next most likely scenario is that we prove P != NP.
The least likely scenario is that P = NP.
"I can't actually deal with challenges raised. Therefore, I will bypass all of that with appeals to poor character instead."
You're just demonstrating why we shouldn't take you seriously either. If you could just easily debunk the challenges and move on, why aren't you doing that?
Isn't that how we sharpen the math and science? Debunking the pseudoclaims? So why is everyone using ad hominems instead?
@SokobanHero@AcerFur@Polymarket Can you provide specific documentation? I just don't have a habit of believing things solely based on people's say so and insistence.
@etubruton@dohewater If you know how computers work, you know that one program can't be the arbiter of truth. So casually citing it as so is akin to foolishness.
@grok What does lean run on? One word answer only please.
To be clear, I recognize substantial evidence exists. I haven't yet established that the verification methodology warrants the current confidence people place in it. Extraordinary claims require extraordinary evidence. This has the potential to be the most significant milestone in mathematics in generations. Going from claim to confirmation in under a day is, to be quite frank, a bit premature. Getting defensive over actual mathematicians being skeptical is unbecoming.
I'm going to go further and deep dive into Lean itself. I don't trust it, but I have no reason to. If I can examine how and why it works, and how it's able to somehow beat every other software system in being trustable, I'll change my mind. But it's going to defy a property of every software system I've seen.
There's no excuse for blindly trusting something on someone else's say-so. Anyone who does is automatically untrustworthy.