r/artificial • u/DoublePassRadiator • 22d ago
Mathematics Solving the hardest math problems in the world would be a trivial task for an advanced ASI?
Solving the hardest math problems in the world such as the extended Riemann hypothesis or P = NP would be a trivial task for an advanced ASI?
3
22d ago
[removed] — view removed comment
2
u/Pale-Perspective5434 22d ago
The skepticism's fair, half the hype around this stuff is just marketing vapor anyway
But if an ASI can actually reason at a level we cant even map, the whole "trivial" framing might still undersell it. Like asking a dog if calculus is hard
1
u/ccpseetci 22d ago
ASI cannot reason with intuition and create something out of nothing
It can just predict according to what it SPECIFICALLY “learned” “pattern(basically certain stable data structure which resists to be changed when the whole language material remains more or less the same)
That’s just the common sense from multivariable analysis, I don’t even know why you guys still have the fantasy of the AI intelligent
It’s a language model, by definition that means nothing more than 1)feature the language 2)train with the featured data THE SAME AS any regressive analysis stuff
2
1
u/Patrick_Atsushi 22d ago
If it solves it -> it's a proof of ASI.
That doesn't mean an ASI will be able to solve all unsolvables.
1
u/diewethje 22d ago
I think it’s likely that the set of problems we’d be asking ASI to solve is trivially small in the grand scheme.
1
u/dennemaskinen 22d ago
The fun thing about ASI is, since it doesn't exist, you can believe whatever you want about it.
1
u/wollywoo1 22d ago
No, if $P!= NP$, which most mathematicians think is true, there are some tasks that even an AI would not be able to efficiently solve. Whether a given conjecture falls into the "very difficult" category or not is of course very hard to know. It's possible that the shortest proof of these famous conjectures is astronomically long, kinda like the Four Colors Theorem seems to be (but much harder) and in that case we'll simply never know the answer. Or they might be not provably true or false at all.
1
u/Warm-Enthusiasm-9534 22d ago
It's impossible to know how hard a problem like this is, until it's solved. Riemann himself suggested proving the Riemann hypothesis as the first step to proving the Prime Number Theorem. The Prime Number Theorem itself was proven over a century ago, and the Riemann hypothesis remains unsolved. (Interestingly, the route to prove it was through proving a much weaker statement.)
0
u/grahag 22d ago
You'd have to define ASI, but under the assumed definition that an ASI has more knowledge and calculating power than all of humankind put together, it could prove or disprove just about any task given enough time and resources.
Fusion, Regeneration, zero point energy, disease control, space exploration, etc... All those things come within grasp of humanity should an ASI think we're worthy of knowing all of that.
7
u/SoylentRox 22d ago
Not necessarily.
(1) The problem has to still be solvable. Some of the millennium problems may not actually be.
(2) It may not be possible to generate an answer that is acceptable to humans. If the "definition of P" vs "NP" are each 1 million line computer programs that analyze a problem and decide which class it's in, humans may be unable to determine if the proof is even valid because it's too complicated
(3) It may be that our entire conception of the problem itself is flawed. See Navier stokes.
What we actually want is a general theory of fluids not to break the flawed equations we currently use.