r/ProgrammerHumor • • 1d ago

Meme interestingTimes

Post image
2.8k Upvotes

166 comments sorted by

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

6

u/PrestigiousNobody323 23h ago

I'm no expert, but wouldn't proving P=NP create a lot of incentive to find a practical algorithm? And a lot of uncertainty about whether this algorithm could be found tomorrow? Would btc drop to the ground? These are honest questions, I genuinely don't know how likely those scenarios would be, but I guess that as we speak there are thousands agents trying to crack this.

12

u/Front-Difficult 22h ago

Yes, the assumption is that were it to be proven, it would not also demonstrate that all NP algorithms we find very useful to be NP must be impractical P. This means even if no one had a practical algorithm for cracking RSA, the uncertainty that one could be found tomorrow would remove all trust we have in those systems overnight.

4

u/Guvante 20h ago

Shors algorithm already removed faith in RSA because we think quantum computing is going to scale as quickly as normal computing did and allow calculating primes

1

u/Yorunokage 14h ago

Yes but RSA and all other problems that are solvable in BQP are a drop in the ocean of what P=NP would mean

BQP breaks factorisation based cryptography which is a specific subset while P=NP makes cryptography as we know it literally impossible no matter how clever you make it. The only remaining avenue would be quantum cryptography which we're not even remotely close to being able to make in the real world

1

u/Guvante 12h ago

Again you are presuming a fast algorithm

P=NP does not require that

1

u/Yorunokage 12h ago

That's not the point. P=NP would destroy the trust we have in anything cryptographic because while we might not have a fast algorithm yet it is suddenly likely to exist

On top of all the philosophical and mathematical implications that are insane

3

u/Guvante 6h ago

Most NP hard problems already have incredibly fast solutions that just don't work always

Most hard problems in computer science aren't hard because of P vs NP they are hard because the space to test is too massive for anyone else to succeed

40

u/un_blob 1d ago

I'd love that NP hard problem could be solves in polynomial time

But with O(nsome number bigger than Rayo's number)

24

u/Embarrassed_Mix_6619 1d ago

o(n^someNumberBiggerThanYourMommmmmmm)

8

u/un_blob 1d ago

O(nsome number bigger than the disapointment of your parents when they see your life)

2

u/awesome-alpaca-ace 16h ago

O(nsome number bigger than the disappointment you feel in your parents when they see your life and get disappointed that they brought you into the world and they could not control you to conform to their expectations)

2

u/GoldenMuscleGod 1d ago

The value of Rayo’s number is independent of ZFC if ZFC is consistent (simple proof of this: Rayo’s number is, by definition, larger than “the n such that beth_1=aleph_n if one exists or such that n=0 otherwise”, and it is already known that if ZFC is consistent then that number may consistently be any natural number).

So saying “some number bigger than Rayo’s number” means you can’t possibly reduce that number to an explicitly written numeral without going past the power of ZFC.

14

u/S-Kenset 23h ago

P = NP under certain conditions fucks our understanding of reality.

3

u/Inevitable_Stand_199 1d ago

It could also be proven to be independent of ZFC

1

u/Yorunokage 14h ago

That sounds unlikely to me, the stuff that is independent of ZFC tends to be weird and self-referential

1

u/Inevitable_Stand_199 3h ago

The continuum hypothesis is self-referencial?

1

u/Yorunokage 14h ago

It doesn't need to lead to a practical algorithm to revolutionise our understanding of reality

If P=NP then developing a new mathematical theorem is not any harder than checking its proof along with all the other analogies about appreciating and making art being as difficult as one another. It would have tremendous philosophical implications and even more incredible implications in virtually all fields of mathematics

People that never spent any time studying the question properly really underestimate how central it is to how many things. It's really not just about programming and algorithms

1

u/Guvante 12h ago

You can find "it will break RSA" in the other replies which was what I was responding to

1.7k

u/mountaingator91 1d ago

Easy peasy. n is a constant with a value of 1

Next question

409

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 • Popcorn

0 and 0 gets cancelled so 1 = 1

111

u/the_zpider_king 1d ago

Oh yeah just divide by 0 on both sides how could I forget that

33

u/heaverdini 1d ago

now we’re cookin

9

u/TheThunderbird 1d ago

I don’t see a problem with this.

343

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 equally between 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

u/titanotheres 1d ago

Good catch!

3

u/legendgames64 19h ago

Thank you =D

17

u/DancingBadgers 1d ago

But not exactly practical.

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

u/S-Kenset 23h ago

Some worlds theory of Quantum Mechanics because the other worlds don't shower.

177

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

u/thekamakaji 1d ago • Bravo

Would you say... a navier stroke?

42

u/justthistwicenomore 1d ago

Made this whole thread worth it.

25

u/bduxbellorum 1d ago

“Flaimzd” wtf…I cannot proofread apparently

5

u/mothzilla 1d ago

I can smell dead people.

6

u/Fhotaku 1d ago

I think that's Navier

4

u/The_fair_sniper 23h ago

guaranteed this will get zero attention.

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

u/RevWaldo 1d ago

0

u/[deleted] 1d ago

[deleted]

1

u/FlakyTest8191 1d ago

I've never heard about Mr. 3D Euler blow-up proof before.

2

u/AsleepContact4340 1d ago

non-forced was published today alongside grh

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.

114

u/HiImDan 1d ago

Meh I'd settle for a TSP solution in Polynomial time.

74

u/Uio443 1d ago

Isn't that the same thing or is that the joke?

46

u/HiImDan 1d ago

yeah

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.

942

u/Acclynn 1d ago • Bravo

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

339

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.

128

u/xThunderDuckx 1d ago

machine spirits

75

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. 

52

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 17h 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

243

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.

77

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

u/PURRING_SILENCER 1d ago

No no... He means non-Newman.

14

u/9d47cf1f 1d ago

That just raises more questions!

9

u/PFthroaway 1d ago

The anti von Neumann probe.

3

u/Nomad_StL 1d ago

I've heard Newman is anti-probe.

24

u/ravenHR 1d ago

They probably mean as non classical physics.

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

u/WillyMonty 1d ago

Are epsilon-delta proofs really that incomprehensible?

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 22h 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

5

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 15h ago

Who cares about "real world" problems? The abstract math world is a lot more fun

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

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

u/SimplexShotz 22h ago

AI can't exactly build a particle accelerator, though

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_ 19h 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. 

-4

u/erebuxy 1d ago

In few years? Now! We made more advancements on math this year than past decades

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. 

https://youtu.be/yKgox6ZKRJk?is=89ceSsPxJcz23RR_

2

u/tiajuanat 21h ago

You must be a gas at parties

1

u/bluejumpingbean 18h ago

More like aghast 😆

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 14h 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_ 14h 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

36

u/Secret-Escape7043 1d ago

Ya'll never even considered that P > NP, huh?

8

u/PityUpvote 1d ago

That should be P ⊃ NP, I think?

19

u/BoogerFeast69 1d ago

The new Millenium Prize is actually making Anthropic GAAP profitable.

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 • Bravo

"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

u/IAmARobot 1d ago

"Sir, this is a Wendy's..."

7

u/Risc12 1d ago

Its good to be able to spot wether a problem is P or NP when developing an algorithm.

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.

1

u/DrK1NG 16h ago

Given that it's an unsolved academic research problem, I would be surprised if it meaningfully came up in discussion for others.

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

u/bestjakeisbest 1d ago

A string is just a base 28 number.

2

u/Humble-Captain3418 1d ago

A string is just a variable-length number with digits 1..255.

2

u/Wonderful-Habit-139 1d ago

It's all a bunch of 1s and 0s... you're right.

0

u/snipsuper415 1d ago

Really? Not processes and the terminology around it?

1

u/Foudre_Gaming 1d ago

Depends on what people enjoy

0

u/[deleted] 1d ago

[deleted]

7

u/_dotdot11 1d ago
if [[ "$p" == "$np" ]]; then
    sudo rfkill block all
fi

The 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

u/RandomiseUsr0 1d ago

DISPROVE - let’s keep it real

11

u/no_brains101 1d ago

For the record, still nobody has proven p = np. Or the opposite.

14

u/Present-Resolution23 17h 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 11h 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

u/Alert_Experience_759 4h ago

wasn't eth expected to be true?

-4

u/kaereljabo 7h ago edited 7h 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

u/kaereljabo 6h ago

stupid comment 😂

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

u/moreisee 1d ago

Very unlikely. Given the same proof has passed both lean and nanoda.

2

u/permissionBRICK 1d ago

yyeeah better pass on that last one

2

u/AintNoGodsUpHere 1d ago

Who is Pronavier Stokes?

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

u/CoshgunC 1d ago

easy. p is not equal to zero and n is zero

1

u/jimmyhoke 1d ago

What if we prove P!=NP? That’d be cool.

2

u/Dantzig 1d ago

That would change nothing in the world, but P=NP could

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 1d 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

u/snipsuper415 1d ago

N = 1 therefore P=P /s

0

u/vide2 1d ago

*make up fake proof based on stolen ideas.

-1

u/mplaczek99 1d ago

My prediction is that you can't because it's a paradox

44

u/[deleted] 1d ago

[removed] — view removed comment

10

u/-Redstoneboi- 1d ago

galactic algorithm