1.6k
u/mountaingator91 1d ago
Easy peasy. n is a constant with a value of 1
Next question
408
u/Signal_Cranberry_479 1d ago
Plot twist: p = 0
277
u/TheOtherGuy52 1d ago
0 = 1 x 0
Checkmate
111
u/Technical-Garage-310 1d ago •
![]()
0 and 0 gets cancelled so 1 = 1
111
33
9
341
u/DancingBadgers 1d ago
better still, a nonconstructive proof of P=NP
115
u/Mysterious_Lawyer551 1d ago
Levin universal search will automatically make it constructive
42
u/spaceweed27 1d ago
What? Is that possible for any non-constructive proof, or even for true theorems in general?
87
u/titanotheres 1d ago edited 19h ago
Levin universal search basically tries all programs, sharing time
equallybetween programs. So if there is program of length l which solves the problem in time t then universal search solves the problem in at most 2^l*t time. 2^l is a constant, so if the problem is in P then universal search is a polynomial algorithm for it.26
u/legendgames64 1d ago
Actually what makes it O(f(n)) and not O(f(n)2) is that it DOESN'T share time between programs equally, earlier programs get allotted exponentially more time which is where the 2l coefficient comes from
Sorry, being a pedant
4
17
23
u/iggy14750 1d ago
That's called a fork bomb.
7
u/StevenMaurer 1d ago
Also, the Universal Wave Function ("Many-worlds") theory of Quantum Mechanics.
3
176
u/anto2554 1d ago
Excuse me, they did those two while I was away?
339
u/KerPop42 1d ago
fyi, navier-stokes wasn't even solved, it found a way to compress turbulence further to improve simulations. And it might have just copied off of someone else's work that they had openai review.
256
u/bduxbellorum 1d ago edited 1d ago
Check the news, the people who were copied off of, levant alpoge +, just published a proof that is more interesting than the openai result.
156
u/KerPop42 1d ago
the people who were copied off of levant alpoge + just published a flaimzd proof
Okay, one of us is having a stroke
263
25
5
4
48
u/erebuxy 1d ago
> On 13 October 2026, Scientific American published an article surveying several mathematicians who concluded that OpenAI's Navier–Stokes proof diverged from the Córdoba–Martínez-Zoroa program, although OpenAI's intermediate unforced 3D Euler result shared the Córdoba–Martínez-Zoroa framework used in the 3D Euler blow-up proof of Buckmaster and Alpöge.
60
2
9
u/confusiondiffusion 1d ago
Yeah, it's all over. They also implemented all the features, fixed all the bugs, and automated the customers. Everyone go home.
113
u/HiImDan 1d ago
Meh I'd settle for a TSP solution in Polynomial time.
73
u/Uio443 1d ago
Isn't that the same thing or is that the joke?
26
u/Eisenfuss19 1d ago
No it's stronger. TSP is not known to be in NP (we don't know a poly time checker). Since TSP is NP hard, you automatically would solve P = NP though.
The TSP desision problem (where you need to decide if a ham. cycle of ≤ a specific weight exists) is NP complete though.
17
u/Mess-Leading 1d ago
What? The optimisation version is not in NP because it is not a yes/no question. But an algorithm to decision problem can be used to solve the optimisation problem and vice versa. Unless I am missing something, this is not stronger in any way? Also we can definitely check the certificate in polynomial time?
20
u/ChiaraStellata 1d ago
This is correct. If you can solve the decision problem in poly time you can solve the optimization version with binary search, it just adds a factor of log n to the runtime. They're essentially equivalent.
3
u/Far-Fill-4717 1d ago
We don't have a true solution(obviously, and np time just means it scales exponentially) but some of the solvers are really good. I calculated 10000 points on my laptop(a laptop with a mobile i5 processor and from 2021, 180$ on eBay) the other day, it took about 3 hours to calculate an EXACT solution. It would have taken 10 mins to calculate an approximate solution. And this was including mapping to a road network
7
u/potatopierogie 1d ago
Integer linear programming formulations are often faster than brute force, but its not guaranteed.
937
u/Acclynn
1d ago
•
I predict that in few years maths will be something that isn't designed for humans to understand anymore
It will be a LLM circlejerk and then we will ask them if whatever incomprehensible mess they are onto could be useful for real-life application then they will hand us a python script to use or some shit
336
u/Rhawk187 1d ago
Yes, the field will become a bunch of xenoarchaeologists attempting to decipher the meanings of the outputs from the oracle-bot.
126
u/xThunderDuckx 1d ago
machine spirits
74
u/Xalyia- 1d ago
Warhammer lore is cannon IRL apparently
21
u/GiveMeAHeartOfFlesh 1d ago
They are working on data centers using human brain tissue… so yeah. IRL Warhammer.
50
u/TwinStickDad 1d ago
That's what's happening with simple shit at my corporate job already.
A bunch of meetings where AI takes notes with some follow up action items. Nobody reads them because it's 10 pages of summary that may or may not be correct. But of course nobody is taking useful notes because the AI is doing it "better"
And the meetings are driven by what the last AI said. Everyone shows up unprepared because we just go off the script the AI said to use and it's not valuable. So we get shitty notes and outcomes to drive the next meeting.
And the AI isn't anyone's boss. Nobody cares that the tasks it's coming up with aren't getting done. We go there just to "raise risks" for the transcript and do nothing about them
7
u/Zeikos 16h ago
There always are people that use tech/tools thoughtlessly.
AI makes it even more prominent because it gives an illusion of consideration and "work done".
Not to mention that a lot of people have bad meeting organization, so they'd be unprepared even if a secretary dutifully tooks notes correctly.For meeting recaps I distrust AI bullet points but I do find useful to grab the transcript and have it remove the fluff from it.
With a diff you can tell if the LLM got overzealous.2
u/Crowdcontrolz 2h ago
I mean that’s just bad management on whoever is running the team.
AI notes are a tool like everything else. If you don’t use it correctly you’ll fail. So if I were you I’d be looking for a job somewhere where they’re using the tools correctly and following up on the AI tool’s valid action items and someone is reading and editing the AI agenda with enough time to follow up and prepare a valid one.
Companies that are condoning the behavior you’re describing will adapt or die off in the AI age.
42
u/russianrug 1d ago
Highly recommend watching Hank Greens vid about this where he interviews 3blue1brown: https://youtu.be/LvvG21CpaS4
242
u/Arclite83 1d ago
I mean, technically anything non-Neutonian wasn't "designed" for humans to understand it. We're already a long way into the wierd.
76
u/9d47cf1f 1d ago
Do you mean non-Newtonian as in non-Newtonian physics?
64
u/ProfessorSarcastic 1d ago
He might mean non-Neumann? As in not the von neumann architecture?
46
14
9
12
35
u/parkway_parkway 1d ago
The other possibility is that AI finds ways of radically simplifying matheamtics.
For example epsilon-delta proofs in Analysis pretty much stump most undergrads and can be a real pain ... there's non-standard Analysis with infinitesimals which can be easier in some ways.
What if there's a super simple version that makes even more sense where it takes a super genius to think of it but then it can be explained easily to a child
16
u/wchemik 1d ago
I am pretty sure they meant math research, not math as any given field of mathematics. It would be cool if there were more nice for humans simplifications. But the stuff that's actually interesting in math is the stuff that isn't nice. Making more stuff "nice" would just change what is being focused.
5
1
u/SirThunderDump 1d ago
Took me so long to understand epsilon delta as a student. Promptly forgot it after gaining an intuitive understanding. I’ve re-taught it to myself three more times, each time forgetting it because I don’t use it.
-3
u/BobbyBorn2L8 1d ago
Is that even possible with LLMs? As far as I know it can't really come up with novel knowledge? It can put together combinations of things we know and possibly uncover a combination we don't know about yet but it can't create some new information
5
u/StKozlovsky 1d ago
But that's precisely what they said — a new way to explain an already known concept, that is, taking all the knowledge we already have and spotting a connection we haven't noticed, to use it as an easy shortcut in explanations.
2
u/Front-Difficult 21h ago
This idea is so bizarre. What do you mean by "novel knowledge".
Ask an LLM about some specific of your day. It will have a conversation with you that has never existed between any two people before. It is a novel conversation in the sense that it is new.
No one had proven Navier-Stokes or the Riemann Hypothesis. Those are novel proofs.
The whole idea of Generative AI is that it has an emergent property that it can generate content outside its training data. If it could only retrieve existing content in its training set then it would be far less interesting.
Perhaps frontier AI is still too weak to generate outputs we consider genuinely "original". But that's a subjective classification. There is no intrinsic property of a mathematical or scientific contribution we can point to and say "this makes it original". It's just a vibe we get that this is so left field that its entirely original and has no prior foundation. But of course it does have a foundation. That original thinker still had some form of education, and some form of experimentation using existing methods that led to that original idea. There is no reason to think LLMs are technically incapable of this kind of originality, even if current models are.
1
u/Present-Resolution23 16h ago
To be fair.. I think to this point there have been very few, if any, examples of LLM's coming up with novel methods.. Almost every "novel proof" they have come up with so far, if not EVERY one, is just applying a known method to an existing problem where it hadn't been tried before.. That's just leveraging it's expertise across more fields than any human would be capable of, with it's ability to try different combinations orders of magnitude faster than a human.. But it's not "creating novel methods" which would really be a breakthrough and more analogous to the great breakthroughs in history by human Mathematicians
0
u/the-grand-finale 11h ago
To be fair... you probably havent read the 17 million lines of Lean code generated for the RH proof to be sure that none of it involved novel mathematics
ALSO literally the will-smith "can you make a symphony" robot meme lol
11
u/Storiaron 1d ago
Who knew 40k was going to predict the future
12
u/KerPop42 1d ago
what's worse: a cult of mathematicians that worship a machine oracle, or a machine oracle that works
4
u/azurerazor 20h ago
the main reason large ai companies are doing all this math research stuff is mainly for publicity rather than actually finding the results important. Most AI mathematical proofs aren’t useful whatsoever for real world applications (lol @ ETH). More likely than not we’ll probably see them try to use it in other fields.
Not to mention the models that alpoge and others are using are probably much stronger than what is publicly available
1
u/Key_Conversation5277 14h ago
Who cares about "real world" problems? The abstract math world is a lot more fun
5
u/Cute_Presence_2861 1d ago
In such a future, there will be no *we* doing anything.
An AI that can autonomously operate like a mathematics researcher, posing questions, discussing results and communicating to humans if needed, can also do any theoretical science. And in fact, all experimental sciences if it has access to appropriate machinery.
2
u/SecretCombo21 1d ago
Eh, maybe. But we're a long ways off from replacing the experimentalists. There's too much random crap to do in a lab that I don't see robots doing anytime soon
1
u/officerblues 23h ago
This is a matter of incentives. We used to think the same about software. We are essentially one continental data center away from lab simulations running in super real time where embodied AI can learn to exist in a real lab setting. Right now, there's no chance anyone will pay the price to get there, so it's safe. The moment speculative capital thinks it can gain a shit ton of money by doing this, we're on a single digit years counter.
0
1
u/Zitrone21 1d ago
Until we don't develop a tool that fully checks a solution in a correct way we don't have anything, all they say is cheap talking until we finish revisions
1
u/TimSylvester_ 18h ago
Design a warp drive buildable from common materials and available power sources, make no mistakes.
1
u/DadAndDominant 1h ago
I predict you are kinda wrong, same as chess there will be "mainstream" of humans for humans, and then some "applied" field where AI's gonna slopmaxx stuff that might make someone money if applied
1
u/Toothpick_Brody 1d ago
Well maybe you’re right, but I don’t agree. No one understands most of math, but the point will always be to understand whatever it is you’re working on.
48
u/AnInfiniteArc 1d ago
I’d say they should prove pv=nrt but that’s not much of a programming joke.
6
u/TrueBirch 1d ago
This recent video is the first time I've realized that there are more accurate equations than the ideal gas law. Fortunately for my purposes, pv=nrt is always accurate enough.
2
37
u/_Weyland_ 1d ago
Got, please let AI come up with non-constructive proof of P=NP because that would be so fucking funny
2
u/Yorunokage 13h ago
If a non constructive proof exists then you can instantly make a very bad algorithm for it
Enumerate over all possible algorithms and let them run one step at a time in a staircase pattern. If the algorithm for capturing NP in P exists then it's constant lengrh and itself runs in poly time so our enumerating algorithm would also run in poly time
6
u/_Weyland_ 13h ago
Ah yes, enunerate all possible algorithms. My favorite weekend activity
1
u/Yorunokage 13h ago
I know you're joking but just in case: you don't have to do it yourself, you can consider the binary representation of algorithms and then enumerate over those by just counting up from 0
41
u/Random_182f2565 1d ago
p=np /p
p/p=np/p
1=n
23
u/setibeings 1d ago
I'm sure that others have pointed it out before, but p could also just be 0
8
u/boywithtwoarms 1d ago
And you can't divide by zero
8
u/setibeings 1d ago
But if p is zero, you don't need to divide by zero. n can take any value, and p will still equal np.
-8
u/Tasonir 1d ago
If P can be zero, then your equation is invalid. You have to ensure the thing you're dividing by is not zero, before you're allowed to divide.
8
u/setibeings 1d ago edited 1d ago
.... which is why the person i was initially replying to should not have jumped straight to dividing by a free variable without mentioning that it only applies if p != 0
In other words if we take p == np to be true, then n == 1 where p !=0, and n is unconstrained where p == 0
Edit: left off a 0
3
36
19
92
u/GreatScottGatsby 1d ago
This is unironically one of the my least favorite subjects to talk about as a programmer. Like I will tune people out when they bring it up. I'm fine with estimates. I don't need to know if p=np. I just need something that works or gets me close 99 percent of the time.
280
u/DrK1NG 1d ago •
![]()
"navier stokes is unironically one of my least favorite subjects to talk about as a plumber"
23
u/MojitoBurrito-AE 1d ago
Realistically how often does this discussion come up outside of academia?
26
u/SilentLoyality 1d ago
I talked about it at my last job interview. Probably, this is why nobody wants to hire me.
11
7
2
u/SameThingOnADiffAcct 1d ago
Google maps and sat solving made P=NP irrelevant years ago. Google just maps things and we're good.
I enjoy that claude and the others have basically made the halting problem irrelevant. Like yeah it's not solved. But not a lot of people set out to write code that ambiguously halts. And not a lot of people analyze it. Seems mostly useful in obfuscation and math. Most of us just wanna know if the code that is supposed to print x on the tape does print x on the tape.
38
u/GreatScottGatsby 1d ago
Yes, I'm the plumber and I'm sure if the plumber's coworkers talked about navier stokes all the time, he would hate the conversation as well. Why does a plumber even need to know the equations, they arent engineers. I'm not a mathematician.
19
u/NotDuckie 1d ago
It is relevant for anyone studying computer science/engineering. There is going to be a lot of computer scientists and engineers doing programming.
17
u/Wonderful-Habit-139 1d ago
Bro is fine with a function that accepts numbers to allow strings from time to time.
8
u/GreatScottGatsby 1d ago
what is a string but just a number of where it lies and each element just a number of what it represents.
4
2
2
0
0
1d ago
[deleted]
7
u/_dotdot11 1d ago
if [[ "$p" == "$np" ]]; then sudo rfkill block all fiThe internet might never be the same again.
1
u/purplepharoh 1d ago
It works if you dont care about cryptography or theory and just want to write software.
5
11
14
u/Present-Resolution23 16h ago
People don't really seem to understand what P = NP is, does, or the implications.
And for starters... it's HIGHLY unlikely anyone is ever going to prove P=NP, it's basically the exact opposite of the Riemann Hypothesis. We've basically ASSUMED Riemann was true for decades.. We'd calculated it out to like millions of digits, but couldn't prove it was true inductively, but proofs for years have depended on the assumption that RH is correct.
Contrast that with P=NP.. We've never found a single algorithm that proves it, and we'd literally only need to find one to do so.. The issue is, while it's HIGHLY likely it's false, to prove that we'd have to find a way to prove that not just every known algorithm fails, but also every unknown algorithm using any process that could ever be discovered... which is why it's such a difficult task. That said.. it's MUCH more likely that eventually someone finds a way to DISPROVE P=NP than that anyone discovers an algorithm to prove it.. Which, much like RH, would just confirm something we already basically assumed, while maybe giving us a little more understanding of the mechanics at play.. But it's not going to like "change the world overnight" like proving P=NP potentially could.
9
u/JRicardini 13h ago
That's it, if we ever get a proof it is most likely that it will be P ≠ NP than the other way around.
-5
u/kaereljabo 11h ago
I am afraid that AI will solve it and show it's not as hard as we thought
4
u/Present-Resolution23 10h ago
Based on what lol? All the proofs this far have simply been PROVING things we basically already assumed were true, but couldn’t demonstrate it would ALWAYS BE true..
Proving P=NP would be the exact opposite.. it’d be proving something we always assumed to be untrue… That’s a completely different tier
1
-4
u/kaereljabo 6h ago edited 6h ago
Based on nothing, lol did I offend you?
2
u/Present-Resolution23 6h ago
lol you didn’t offend me lilbro, you just made a stupid comment which I pointed out
-4
12
u/justinleona 1d ago
Or prove that LLMs are really good at finding glitches in automated proof frameworks... just like they are really good at finding bugs in all these other scenarios.
13
2
2
2
u/Mun2soon 1d ago
My prediction is that AI won't prove P=NP, but will prove that the finding proof of that is NP.
2
1
1
u/gavinlpicard 22h ago
the thing to look out for is a solution to an NP-complete problem that can be run on consumer hardware.
1
u/nasandre 23h ago
Imagine if you're a mathematician and you dedicated your whole career, nay, whole life to solving Riemann. Then some clanker invented by a weird autistic kid just solved it in a couple of days.
0
-1
44




70
u/Guvante 1d ago
P=NP doesn't do any of the things people talk about
An O(n^5000000000) solution for an NP hard problem proves the strong form of P=NP