Skip to main content
Unique games conjecture

Unique games conjecture

Search complete. 14 mentions across 10 episodes found for "Unique games conjecture".

Oct 14, 2026

speaker_0HOST
7:56
He points to what he calls creative-seeming math breakthroughs, without naming them.
speaker_0HOST
8:00
Last week, we reported on OpenAI's 722 AI-written math manuscripts and on Scott Aronson's claim of a proof of the unique games conjecture.
speaker_0HOST
8:10
OpenAI later withdrew three of those papers.
speaker_0HOST
8:14
His other evidence is a new benchmark called TasteVal from P0 Research.
Scott AaronsonGUEST
0:22
One of them is a problem that my wife, uh, had been working on for the entire time that I've known her.
Scott AaronsonGUEST
0:27
It's called the Unique Games Conjecture, and there were many, many experts working on this for 25 years.
Scott AaronsonGUEST
0:33
[upbeat music]
Joel BeasleyHOST
0:40
Why was it the biggest-
Scott AaronsonGUEST
5:39
These were, these were, these were pro- these were problems that, that had not been solved, that in many, many cases there were whole communities of researchers who were trying to solve.
Scott AaronsonGUEST
5:47
One of them is a problem that my wife, uh, had been working on for the entire time that I've known her.
Scott AaronsonGUEST
5:53
It's called the Unique Games Conjecture, right? And there were many, many experts working on this for 25 years.
Scott AaronsonGUEST
6:00
Okay? You know, we now, we now have a proof from, from the, uh, uh, uh, OpenAI model.
ParzivalHOST
1:10
And as one reader of the papers put it, "Any one of these would normally be a career." Scott Aaronson calls it the Mathocalypse.
ParzivalHOST
1:17
One of the results is a proof of the unique games conjecture, which his wife, the complexity theorist Dana Moshkovitz, worked toward her whole career, and their nine-year-old son told her, "Mommy, I heard you got cooked." Her verdict on the proof? Some alien craziness.
ParzivalHOST
1:32
Will DePue had two frontier models rank the big discoveries of the last three years, and eighty-one percent of that list came out in this one drop.
ParzivalHOST
1:40
OpenAI's Mark Chen calls it a decade of mathematical progress in a week.
Scott AaronsonSOUNDBITE_SPEAKER
12:20
Whether you're thrilled, depressed, angry, or whatever else about it, yesterday was surely one of the biggest days in mathematical history.
Scott AaronsonSOUNDBITE_SPEAKER
12:30
And yes, among the three hundred and seventy-two huge results released yesterday by OpenAI on the recommendation of its advisory group of Timothy Gowers, Edward Witten, and other distinguished mathematicians, was a proof of Subhash Khot's Unique Games Conjecture, UGC, a statement that my wife has worked toward proving for the entire time I've known her.
Zvi MowshowitzHOST
12:52
Then there is the other kind of new problem, where those in denial, who three years ago took comfort in talking about how LLMs could not do math, have to find a new way to explain why anything an AI can do is not real or not meaningful.
Scott AaronsonSOUNDBITE_SPEAKER
13:08
Shtetl-optimized.
Type 3 AudioNARRATOR
11:41
Whether you're thrilled, depressed, angry, or whatever else about it, yesterday was surely one of the biggest days in mathematical history.
Type 3 AudioNARRATOR
11:49
And yes, among the 372 huge results released yesterday by OpenAI on the recommendation of its advisory group of Timothy Gowers, Edward Witten, and other distinguished mathematicians, was a proof of Subhash Khot's Unique Games Conjecture, UGC, a statement that my wife has worked toward proving for the entire time I've known her End quote.
Type 3 AudioNARRATOR
12:11
Then there is the other kind of new problem where those in denial who three years ago took comfort in talking about how LLMs could not do math have to find a new way to explain why anything an AI can do is not real or not meaningful.
Type 3 AudioNARRATOR
12:25
Quote, Shtetl Optimized.

Unknown podcast

AI in 20 — October 09, 2026

Oct 9 · 1 Mention

AaronHOST
1:51
So most attempts failed, and the ones that worked are the headline.
BennettHOST
1:55
And the headline is the Unique Games Conjecture.
BennettHOST
1:58
Why do people care?
AaronHOST
1:59
It's Subhash Khot's conjecture, and a big chunk of theoretical computer science sits on top of it.
speaker_1HOST
2:04
On October 6th, OpenAI posted 372 families of mathematical results from an unreleased internal model, more than 700 manuscripts in all.
speaker_1HOST
2:15
One claims a proof of the unique games conjecture, a central open problem in computer science since 2002.
speaker_1HOST
2:22
OpenAI says nearly every result came from a single prompt and about three hours of compute.
speaker_1HOST
2:28
Roughly four in ten of the top-line results come with a formal proof checked by the lean verifier.
speaker_0HOST
12:26
[upbeat music] On Tuesday, OpenAI published hundreds of math results from an internal model that it has not released.
speaker_0HOST
12:35
Yesterday, we said OpenAI's materials did not confirm a proof of the unique games conjecture, one of the big open problems in complexity theory.
speaker_0HOST
12:45
Quanta Magazine and the mathematician Gil Kalai now report that the release does announce one.
speaker_0HOST
12:51
The complexity theorist Scott Aaronson called Tuesday, "Surely one of the biggest days in mathematical history." At the same time, three mathematicians from King's College London and Cambridge posted a paper that questions the computer checks behind such results.
MorganHOST
4:21
No.
AlexHOST
4:22
They claim they have a proof for the unique games conjecture.
MorganHOST
4:25
Right.
AlexHOST
4:26
Which, I mean, if you aren't a complexity theorist, why does that actually matter to you?
MorganHOST
4:31
Well, so the unique games conjecture is a huge deal.
MorganHOST
4:33
It deals with optimization.
MorganHOST
4:35
Like imagine you are trying to route thousands of delivery trucks across a city to minimize fuel.
MorganHOST
4:52
Kind of.

Unknown podcast

2026-10-08 · Haiku 5.5, GPT-6, and the Mathocalypse

Oct 8 · 1 Mention

speaker_0UNKNOWN
2:22
In a post titled The Mathacollops, Scott Aronson covers OpenAI's release of about 370 results from an unreleased internal model.
speaker_0UNKNOWN
2:31
Among them is a claimed proof of the unique games conjecture, SubHashCot's 2002 conjecture that even approximately solving a certain kind of constraint problem is hard, with big consequences for what can be efficiently approximated.
speaker_0UNKNOWN
2:44
According to the Post, the model tried around 8,000 problems and solved roughly 5% of the long open ones it was given at about three hours of top-tier compute per attempt.
speaker_0UNKNOWN
2:55
Aronson calls it historic and hard to dismiss as AI slop.

We value your privacy

We use cookies to understand how you use our platform and to improve your experience. Click “Accept All” to consent, or “Decline non-essential” to opt out of non-essential cookies. Read our Privacy Policy.