202 points OfficialTurkey 1 hour ago 139 comments
senderista 1 hour ago | parent
karahime 1 hour ago | parent
bravoetch 52 minutes ago | parent
xpct 51 minutes ago | parent
There's no gatekeeping here!
reasonableklout 31 minutes ago | parent
hgoel 18 minutes ago | parent
We cannot have them rushing to publish amidst tons of confusion, rumors of threats/scooping and outright plagiarism of existing work (by failing to cite said work).
If they're going to participate as scientists in these more rigorous fields, they're going to have to match that level of rigor, not lower it to the disastrous low that ML research publication is at.
ravenical 1 hour ago | parent
binlog 1 hour ago | parent
fph 52 minutes ago | parent
traes 41 minutes ago | parent
adverbly 7 minutes ago | parent
k2xl 1 hour ago | parent
sebmellen 1 hour ago | parent
Look at one of their examples of an initial prompt: https://github.com/openai/math/blob/main/reasoning_traces/re...
ndriscoll 57 minutes ago | parent
No idea what it's so excited about, but it's cute that it "is." I for one welcome having access to a math buddy 24/7 that's way above my level but also always "willing" to talk at where I'm at.
adverbly 20 minutes ago | parent
Interesting that its only an excerpt. I wonder what else they include but didn't share.
ed 1 hour ago | parent
ks2048 52 minutes ago | parent
gizmodo59 1 hour ago | parent
fspeech 49 minutes ago | parent
gizmodo59 46 minutes ago | parent
Not really? We are at a point if an AI today can solve it, it can be stepping stone of understanding something deeper to tomorrows AI and it continues. Sort of like our limitations doesn't matter. Obviously there are many scenarios in this recursive loop but saying it isn't much progress is not how I view this as
fspeech 43 minutes ago | parent
fspeech 45 minutes ago | parent
binlog 43 minutes ago | parent
fspeech 38 minutes ago | parent
gpt5 40 minutes ago | parent
We are not far away from the moment where these models will be restricted, and sharing the results will be done more carefully.
fspeech 33 minutes ago | parent
caaqil 39 minutes ago | parent
Who is "we" here exactly?
fspeech 30 minutes ago | parent
caaqil 18 minutes ago | parent
Right. Before all the AI disruption, pure Math traditionally welcomed anyone who wanted to study its esoteric proofs, right? I remember all the excitement of the average Math enthusiast casually reading Wiles' proof over coffee.
Bottom line is, the relevant people can still understand the generated proofs. The disorienting part is they are a little slower than they'd like, but they'll get there.
yieldcrv 17 minutes ago | parent
Look at that, taxpayer funding was cut and a private sector solution came in just the nick of time, far accelerating the holding patterns we’ve been in for decades
Humanity doesn’t need all iterations towards the blueprints, the blueprint is good enough, we all stand on the shoulders of giants
fspeech 7 minutes ago | parent
He spent years formalizing his sphere packing theorem because the proof (human produced) was already beyond the ability of peer review. Now his formalization efforts likely can be easily reproduced by a model. However one should read his experience about what a formal proof is: often the problem is the statement not the proof. The example he gave is the Jordan curve theorem. It's actually quite challenging to formalize the concept of a planar curve (there are space filling curves). So it is not necessary that someone can look at a formal statement and say aha it is about a planar curve, unlike FLT where there is not much problem in recognizing what the statement is about.
traes 43 minutes ago | parent
xpct 40 minutes ago | parent
traes 23 minutes ago | parent
NewsaHackO 18 minutes ago | parent
traes 14 minutes ago | parent
ndriscoll 13 minutes ago | parent
lanyard-textile 21 minutes ago | parent
traes 16 minutes ago | parent
zone411 20 minutes ago | parent
enoether 1 hour ago | parent
[0] https://en.wikipedia.org/wiki/Unique_games_conjecture [1] https://github.com/openai/math/blob/main/preprints/The-Uniqu...
impossiblefork 41 minutes ago | parent
gregdeon 28 minutes ago | parent
inkysigma 11 minutes ago | parent
Catloafdev 1 hour ago | parent
Basically "Here you go, have fun with this, fuck all your demands, by the way we're gonna be releasing the model stay tuned!"
open592 59 minutes ago | parent
Seems like a lot of PHD students are doing to have to pivot the entire structure of their PHD studies? Or just produce something which is already written by OpenAI?
binlog 57 minutes ago | parent
xpct 48 minutes ago | parent
It has to feel awful to be in this position.
torben-friis 44 minutes ago | parent
:)
caaqil 53 minutes ago | parent
Precisely what all NLP researchers and the ML community at large did in the last few years: embrace the frontier and realize that attention is all you need.
aaraujo002 53 minutes ago | parent
dcl 52 minutes ago | parent
dekhn 50 minutes ago | parent
thimotedupuch 39 minutes ago | parent
dekhn 29 minutes ago | parent
My approach would require custom engineering for every different sequence we'd want to target. With CRISPR, you just "program" the system with a guide sequence, you don't need to do massive engineering to solve a protein design problem.
vinyl7 47 minutes ago | parent
bobmarleybiceps 44 minutes ago | parent
moralestapia 25 minutes ago | parent
hgoel 23 minutes ago | parent
claaams 19 minutes ago | parent
yieldcrv 16 minutes ago | parent
glitchc 16 minutes ago | parent
ks2048 56 minutes ago | parent
xpct 44 minutes ago | parent
alexgoodhart 19 minutes ago | parent
agnosticmantis 17 minutes ago | parent
1: Author 2: Verifier
/s
aaraujo002 55 minutes ago | parent
"We want to state clearly from the start: we do not endorse this practice, and we ask them to stop testing advanced mathematical problems on proprietary models."
To me, this is a take against progress so that mathematicians can keep their jobs. What would we do if, instead of math, we were talking about diseases? Are we going to keep diseases around so that doctors can keep their jobs too?
osiris970 53 minutes ago | parent
medler 51 minutes ago | parent
esafak 44 minutes ago | parent
warkdarrior 50 minutes ago | parent
> "I believe that AI can contribute positively in all of these directions [NB: exposition, community building, new directions of study]"
jhrmnn 48 minutes ago | parent
mattr03 48 minutes ago | parent
bravoetch 29 minutes ago | parent
It's been a while since I was reminded of this xkcd: https://xkcd.com/435/
fph 48 minutes ago | parent
tchalla 47 minutes ago | parent
> At present, some frontier AI labs are testing advanced mathematical problems on proprietary models that remain inaccessible to the broader scientific community. Our recommendations are formulated with this practical context in mind. However, ideally, they would not do so. We want to state clearly from the start: we do not endorse this practice, and we ask them to stop testing advanced mathematical problems on proprietary models.
To me, the issue is that the models are proprietary which are only accessible to a few people in 2 digits. It's not about progress but access.
aaraujo002 42 minutes ago | parent
perching_aix 45 minutes ago | parent
Not so for maths.
bmitc 22 minutes ago | parent
pavitheran 54 minutes ago | parent
password54321 46 minutes ago | parent
orlp 25 minutes ago | parent
Can we get a number in Blackwell GPU-hours, kWh, or some other compute-scaled metric?
Jtarii 4 minutes ago | parent
mathisfun123 53 minutes ago | parent
Prediction: one of these is wrong and this (publicity stunt) will backfire.
Edit: don't tell me about lean. For lean to function as a proof certificate you need to represent the theorem correctly. Again: good luck doing that across such a broad swath of problems.
jojva 31 minutes ago | parent
> Some of the unformalized results could have issues. We will endeavor to fix any such issues quickly. We are also exploring community-hosted repositories for these materials.
mathisfun123 29 minutes ago | parent
dekhn 51 minutes ago | parent
It's fine if not, but it'd be great if even just one of these helped us solve a long-running problem.
kevinwang 46 minutes ago | parent
prideout 45 minutes ago | parent
https://github.com/openai/math/blob/main/preprints/Paired-st...
kingstnap 45 minutes ago | parent
109. Integer multiplication below n log n
Surprising that this is possible.
158. The Euclidean plane cannot be colored with five colors.
Only 6 and 7 remain!
376. Universal computation in forced Navier–Stokes flows.
Morning coffee proven turing complete
mFixman 37 minutes ago | parent
LMAO, I don't think I ever saw such a small number in a CS result.
sobellian 34 minutes ago | parent
Very surprising result though! Multiplication is easier than sorting.
kingstnap 30 minutes ago | parent
Like there is somehow redundancy in a fourier transform that makes it sub Linearithmic?
Which low and behold ->
130. Fourier transforms below n log n.
xyzzyz 26 minutes ago | parent
mi_lk 45 minutes ago | parent
yewenjie 43 minutes ago | parent
That copium didn't last for what, three months?
redox99 36 minutes ago | parent
connor11528 32 minutes ago | parent
foota 26 minutes ago | parent
zone411 24 minutes ago | parent
The highest ranked would be:
| 22 | Hilbert’s tenth problem over ℚ |
| 29 | Unique Games |
| 31 | Anderson-model extended states |
| 37 | Spacetime Penrose inequality |
| 48 | Nonexistence of Landau–Siegel zeros |
| 52 | Baum–Connes |
| 78 | Abundance |
| 80 | Hadwiger |
| 87 | Bose–Einstein condensation |
| 92 | Two-dimensional entanglement area law |
applicative 18 minutes ago | parent
stevenhuang 3 minutes ago | parent
anematode 14 minutes ago | parent
nautilus12 19 minutes ago | parent
The ones with lean proofs could still be formulated incorrectly
NotOscarWilde 15 minutes ago | parent
A Polynomial-Time Algorithm for Three-Machine Unit-Job Scheduling [1]
Since some people talk about small numbers that pop up in integer multiplication results, here a completely different number appears:
Theorem 1.1. Let an explicitly listed finite directed acyclic graph specify the precedence constraints on n >= 1 nonpreemptive unit-length jobs on three identical machines. There is a uniform deterministic algorithm that constructs a feasible schedule of minimum makespan. Given also an integer deadline 1 <= T <= n, it decides feasibility exactly and returns a schedule whenever the answer is affirmative. Both tasks can be performed in O((L + 2)^150020) steps on a deterministic multitape Turing machine, where L is the total binary input length.
That is some crazy exponent -- plus an interestingly old computational model to boot; not something that is natural to most of us. I have no capacity to check its correctness today, but I hope it is true purely for the exponent.
[1]: https://github.com/openai/math/blob/main/preprints/A-polynom...
jrflo 14 minutes ago | parent
curtis-jm 13 minutes ago | parent
againstapples 8 minutes ago | parent
Like do you see the technology plateauing at the current level, do you expect progress will continue but only in mathematics, I'm interested to know why others are not concerned?
never_giveup 3 minutes ago | parent
schleck8 3 minutes ago | parent
So in other words, since deep learning is algorithmic research, we are now in the RSI era.
applicative 8 minutes ago | parent
xanderlewis 3 minutes ago | parent
> In a 2020 piece in the Notices of the AMS, I asked the following question: “If one human had an understanding of all of modern pure mathematics simultaneously, how much further would they immediately be able to see?” Six years later we are beginning to understand the answer to this question.