> I don't think researchers in math/TCS will be made obsolete, but I think it will instead no longer make sense to work on any low-hanging, or even medium-hanging (you know what I mean) fruit. We'll be needed for problems where actual novel approaches are needed.
I wonder how this compares to what we see happening with "juniors" in software development? In math research, do you also get the training for the profession from working on the low hanging fruits for a while, to then move to the medium-hanging, and later go on to work on previously unsolved stuff?
If I recall correctly there was a proposed proof to the abc conjecture by Mochizuki https://en.wikipedia.org/wiki/Abc_conjecture#Claimed_proofs which was rejected due to being rather inpenetrable to humans. Shouldn't this be an ideal target for LLMs?
Crazy how intelligence is cheap, efficient and commonplace now. We humans better refocusing our energy on our core values/principles, given most of our skills are becoming irrelevant
Not yet peer reviewed
In the Reddit post there was clarification that this was done with Sol Pro not Ultra - curious what is everyone’s mental model of the difference.
My understanding is that ChatGPT Pro is effectively a multi agent system, or somehow uses multiple LLMs in parallel and selects a best answer. And Ultra is more similar to Claude-Code UltraCode where the main agent can choose to create a dynamic JS workflow that deterministically orchestrates multiple agents to handle different parts of a task and have adversarial checkers etc.
Is that more or less the difference? Any substantiating sources would be great to see.
This is all a depressing and bleak future that I don’t look forward to.
One solution is to ban LLM’s, to artificially create a demand for human thought, that just feels like living in an artificially constructed zoo.
Another solution is humans don’t do anything that AI can do better , / doesn’t need the human touch. So I suppose we will all become artists, sportsmen or politicians, the only jobs that will remain except for select few. Maybe this is ok, I don’t know.
Another solution is we find a way to mind-meld with AI so that human + Ai >> AI alone. This is dystopian, who gets to decide who mind melds with AI, how much will it cost etc etc.
For the stupid copes that the prompt required human ingenuity, let me first add that the author used GPT5.6 to write most of the prompt. He just gave some mild direction. That amount of direction does not require deep expertise and the expertise required will keep falling with time, eventually an undergrad can create this loop and then maybe a high school student.
And prompt engineering / loop engineering nonsense is not real. Calling it engineering is a psy-op because it is something simple, imprecise and future models will be much better at it than you.
In fact, in the future the most likely outcome is you tell the agent what you want (I want this app, or I want this theorem solved) and it will set up the loop, or loop of loops and use all its computing effort to come up with a result. This is completely dystopian to a human life.Cool can we use AI to get a cure for cancer yet? Or is math-turbation the only thing these things are good for? Where are the breakthroughs on actually improving our lives?
The problem is that we're going to have another deepseek moment when someone uses GLM or Kimi K3 to do this.
What I'm feeling is that there's a need to study how to use AI well. I've seen professors using AI, and it was amazing. In that sense, I think AI prompt input will become stratified. In the past, implementation skills were very important, but these days, concepts feel more important this is one of those things.
It's not that AI brings equality, but rather that the output varies depending on how much background knowledge you have. You could call it a stratification of input
I'm starting to feel like there's no place left for programmers like me who focus on quickly churning out MVPs.
Two points:
- Hasn't been peer reviewed yet, so take with a grain of salt. This applies to all claimed proofs, not just AI-generated ones. Even humans hallucinate proofs too!
- The prompt is on page 27 here[1]. It is ten pages of advanced mathematics priming the model in the right direction, apparently informed by a year of prior research. That doesn't invalidate the result if it is genuine, but it is worth noting that this wasn't a matter of "ChatGPT, solve this unsolved problem. Make no mistakes." and required substantial domain expertise and human research beforehand.
Waiting for comments saying that LLMs can't produce anything new and general goalpost moving.
Genuine question: If you still or did think LLMs are just stochastic parrots that just summarize everything and have no form of creativity, what do you think after seeing results like this?
I'm very curious how people reconcile their fear/hatred of AI with actual objective reality. This is actually what interests me most about the whole AI thing. How we tell ourselves what we tell ourselves.
[dead]
[dead]
Except solving problem is probably the least (even though it's important) interesting thing in research...
The most interesting thing in research is finding new questions, that we understand and that we know why they are important. And that's something that humans need to do (by definition)
I know a bit about this field. This conjecture reads as somewhat more niche than the cyclic double cover conjecture recently proved by OpenAI, but nevertheless represents a real contribution.
You want to know how long it takes to solve an optimization problem, in this case over convex, lipschitz functions. (The restriction to a spherical domain is not really a restriction, you can just change variables for any bounded domain.) Anyway, showing upper bounds on time complexity is "easy" because it's just the runtime of your algorithm. Showing (nontrivial) lower bounds is usually much harder because it requires constraining all algorithms.
This proof apparently shows that the lower bound time complexity is equal to the time complexity of an existing 30-year old algorithm: it requires Omega(d^2) function evaluations to solve over this class of functions.
My gut says likely implies that d is the minimal number of evaluations if you have a gradient oracle because you can approximate a gradient with d function evaluations, but I'm not sure how hard it is to make that rigorous.