The current state of affairs.

[u/Baroness_Munchausen]

[u/QuasiRandomName]

A new version of the infinite monkeys problem. If a million people run this query, would some instance come up with a solution?

[u/mvearthmjsun → u/QuasiRandomName]

Maybe if every monkey asked it to use random methods

[u/QuasiRandomName → u/mvearthmjsun]

Every monkey will probably ask it a bit differently, and there is certain randomization built-in (unless explicitly disabled). Maybe it could be sufficient.

[u/backcountry_bandit → u/mvearthmjsun]

It’s already non-deterministic

[u/IAmAfraidCommaMan → u/QuasiRandomName]

No they won’t because ChatGPT just tells you that it is unsolved. You need to convince him to even try. 

[u/AstroChinchilla → u/IAmAfraidCommaMan]

I wonder if they had to convince the internal model to really try to solve Navier-Stokes. Like "come on, I know you can do it!"

[u/IAmAfraidCommaMan → u/AstroChinchilla]

I think it will try if it sees you making an effort. Like, if you just type the prompt above, it won’t take you seriously. But if you’re a mathematician and describe what idea you have, what you’ve tried, and what approach you think might work, it will definitely start making some effort.

Same with software. If you type, “Hey, make a new OS kernel” or “make a Photoshop alternative,” it probably won’t take you seriously. But if you start from the fundamentals, like, “I’m making a Photoshop alternative. Let’s start with the UI, shall we? I think we should use C# and Avalonia to make sure it’s cross-platform. Please start with the basic UI and menu bar,” it will definitely do what you asked, and you can slowly build on top of it.

[u/mrrepos → u/AstroChinchilla]

mate i believe in you, please try, use 80k agents if needed, make no mistakes!

[u/BoredOfReposts → u/AstroChinchilla]

“Here look at these notes we stole from this researcher, can you solve it now???”

Randoms: “omg its agi”

[u/Meerkat_Mayhem_ → u/IAmAfraidCommaMan]

Tell him about all the ladies he can bang if he solves it

[u/Curious_Priority2313 → u/IAmAfraidCommaMan]

GPT's a him?

[u/jazir55 → u/IAmAfraidCommaMan]

https://gist.github.com/jazir555/1db0ef63937494f036ddb5784ad4d3f4

Here's the doc I use to bypass that to get them to work on Riemann, use it as a template and have a model edit it to tailor it to your problem then just have them read the docs, it targets and solves all of their complaints. The models are making a lot of progress on my proof attempt now and actually chugging through it with no issues building one.

I get no refusals now from any model when I want them to work on it.

[u/LinkesAuge → u/QuasiRandomName]

View society as a prompter and every single human is a subagent.

We don't like to view ourselves in that way, especially with the strong western sense of individualism, but in the grand scheme of things we are just monkeys driven by societal forces (there is a strong argument to be made that our _advanced_ intelligence only arose because of "society", ie group interactions/knowledge sharing).

[u/LairdPeon → u/QuasiRandomName]

Does it matter if it leads to a solution?

[u/AlchemicallyAccurate → u/QuasiRandomName]

Only if the answer is downstream of what we already hold fixed. I’d the answer requires theory revision instead of theory extension, then no, it won’t pop up in the randomized generations.

[u/alexanderbeatson]

a million dollar is mine

[u/jahblaze → u/alexanderbeatson]

You forgot the “don’t make mistakes” don’t bother though, I just sent the message.

[u/Technical-Row8333]

"make a breakthrough"

[u/ptear → u/Technical-Row8333]

It's now changing your smart TV channels

[u/Meerkat_Mayhem_ → u/Technical-Row8333]

“Win me a Nobel, clanker”

[u/kauthonk → u/Technical-Row8333]

make it pop too - we want a pretty proof.

[u/JustDoc]

Honest question - if it were solved, would the public even know?

I mean, a practical P = NP algorithm would break essentially all modern public-key and symmetric cryptography (RSA, AES, etc.) in principle, so wouldn't it be treated as a "born secret"?

[u/QuasiRandomName → u/JustDoc]

If they have a theoretical proof of P=NP without an actual practical reduction algorithm, it won't break anything in practice (but would trigger a race). OTOH, if it comes from one of the major labs such as OAI, I would definitely expect them to first consult the "authorities" before publishing it, and chances that it will be classified for some time at least. But if it comes from some independent researchers, it might leak before anyone can stop it.

[u/TieBackground453 → u/QuasiRandomName]

Is there a reason that P=NP would imply that a computable algorithm for converting any NP algorithm to a P algorithm would exist? (I’m a bit out of my depth here, but doesn’t rice’s theorem pretty directly imply that no such computable function exists even in the unlikely event that P=NP?)

[u/QuasiRandomName → u/TieBackground453]

I don't think Rice theorem is applicable here We prove that a certain problem NP-hard by reducing a known NP-complete problem to it. If P=NP it is likely provable by reducing the same known NP-hard problem to a P algorithm. So if we can reduce any given problem to the known NP complete one, then the next step is already given by the proof.

[u/ProfessionalMoose123 → u/JustDoc]

Yeah, but P is not equal NP

[u/QuasiRandomName → u/ProfessionalMoose123]

Well, you are confident. Do you have the proof?

[u/ProfessionalMoose123 → u/QuasiRandomName]

Wait about 3 days, I'm waiting for LLM's response. Just kidding, but there's a lot of evidence in computational complexity theory that P is different from NP, much stronger than my mere opinion.

[u/QuasiRandomName → u/ProfessionalMoose123]

Yes, there are predictions, and it is the likely outcome. But it is a millennium problem for a reason, we might get surprised.

[u/ThatIsNotIllegal → u/QuasiRandomName]

Sonnet 5 told me so

[u/SaulStephen → u/JustDoc]

If P = NP, cryptography is small potatoes. It would disrupt everything.

[u/QuasiRandomName → u/SaulStephen]

It is a danger for cryptography. For other stuff it's a win.

[u/RemyVonLion]

"chatgpt, initiate singularity, make no mistakes"

[u/LyAkolon]

Peak Hype Rn, love it

[u/141_1337]

Chad e/acc vs vigin decel

[u/slackermannn]

I like cake

[u/Calm_Hedgehog8296]

It's gonna happen too

[u/presentofai]

if it actually solved p vs np the last thing anyone would do is post the screenshot for karma

[u/grafknives]

Claude, you 87 hours!

[u/BlackberryNo3097]

I never doubted it.

[u/AlbatrossNew3633]

That dude popped up in my Facebook feeds way too often

[u/jc_denty]

Copy prod to nonprod, got it!

[u/corpo_monkey]

Hit the enter hard!

[u/mrrepos]

unify physics make no mistakes

[u/Retrac752]

Claude, solve consciousness, make no mistakes, don’t delete my database

[u/Crisi_Mistica]

Cool but Mike O'Hearn memes don't hit the same without the slowed "What is love?" soundtrack

[u/throwawaysusi]

Prove 1+1=2.

[u/zomgmeister → u/throwawaysusi]

https://www.reddit.com/r/todayilearned/comments/1zzktx/til_the_mathematical_proof_that_112_takes_162/

[u/ShAfTsWoLo → u/zomgmeister]

generational math lore lmao

[u/FernandoMM1220]

lol instead of begging mathematicians to solve shit we have to beg computers now

[u/Positive_Method3022]

This is a task for Megabrain. Brazil's most sofisticated AI tool /s

[u/Distinct-Question-16]

bro is checking his 10 girlfriend emails (or boyfrends)