Re:Ten advances in mathematics and theoretical computer science
by vlovich123 on Monday August 03, 2026 @11:16PM
(#49164041)
Whether or not it’s on par famously or difficulty level doesn’t predict whether the others will fall. They’re unique problems and math isn’t linear - the Jacobian it managed to find a counterexample and relied on other proofs that had been developed showing >3 case == 3 dimensional case. However, the Riemann may not fall in the same way because it may actually be true or the surrounding math isn’t quite ready to tackle that problem.
Re:Ten advances in mathematics and theoretical computer science
by GPerson on Thursday August 06, 2026 @01:19PM
(#49199571)
When I was in grad school we talked about the Jacobian conjecture as something that would never be solved, and not really even worth thinking about since it’s impossible. There’s been a lot more big open problems solved by AI than which reach the front page of news websites like this. Based on all of these problems getting solved fast I’m just saying I’d be surprised if the Riemann hypothesis lasts another year.
Re:Ten advances in mathematics and theoretical computer science
by plaidfuji on Tuesday August 04, 2026 @03:29AM
(#49165396)
I would be genuinely very impressed - but still not scared - if the Riemann hypothesis were solved. I suspect that we may require “new math” to make progress on that. If a new operator / symbol is required, is that fundamentally not doable by an LLM because it’s outside of current tokenization space?
I’m not sure if people just aren’t as aware, but the Jacobian conjecture practically was on par with those other great problems.