(Asst) Professor, department of Computer Science, Tel Aviv University @TelAvivUni Formerly: @the_IAS, @Princeton
Joined January 2024
- Tweets644
- Following188
- Followers561
- Likes8.5K
Terry's analogy is indeed silly for math, and yet: If human researchers found a vulnerability in the drug trial process, e.g. how to modify proxy biomarkers but not the effect they are meant to predict, they wouldn't knowingly exploit it. Models based on modern optimization would
Without being whiny, we should rationally decide how to treat the OpenAI dump: Most results are likely true and important, but some are incorrect, and all are unreadable. So we can't yet view them as proofs, and we should make sure not to normalize this as a "publishing" method.
Or Zamir retweeted
The question of genocide in Gaza is not just a matter of “semantics,” as many are now claiming, quietly backpedaling from their earlier confident assertions. It is not a borderline case, or a matter of interpretation, or an issue on which reasonable people can differ.
It is an obscene lie, contradicted by everything we know about Israel’s conduct during the war (which is not to absolve the IDF of war crimes). Here are 76 retired senior military leaders and legal experts flatly rejecting the genocide allegation:
“Israel has not committed genocide but rather set a high bar for how to conduct urban warfare against an enemy who will stop at nothing, including the death of its own civilians.”
The fact that the rector of my own university wanted to prohibit questioning the “Gaza genocide,” as though it were the equivalent of flat-earthism or climate denialism, still fills me with disbelief and rage. One day it will become clear who are the real flat-earthers here.
jinsa.org/open-letter-from-m…
I see dismay, rather than excitement, about yesterday's slop-drop, especially among students, sadly fanned by the more senior. For what it's worth, nearly all results on this list are surprisingly "within distribution" of what we'd expect seeing, just faster and far less readable
Or Zamir retweeted
With, reportedly, 372 solved problems out of around 4000 tried, I think my earlier heuristic remains roughly accurate.
Maths is very much not solved! (Though having a magical proof producing machine that works 10% of the time does change it a lot...)
Oop.
To me, the surprising ones in TCS are the DFT/Integer Multiplication improvements.
We’re releasing a broad range of new mathematical results produced by an internal frontier model.
We’ve been consulting with the independent Advisory Group on Mathematics and Artificial Intelligence at the Institute for Advanced Study, and we have drawn on their advice and public recommendations to inform how we release these results.
github.com/openai/math
Or Zamir retweeted
This week we mark 3 years since the #October7th massacre. TAU lost 124 students, staff, alumni, and family members on that day and in the ensuing wars. Together with the people of Israel everywhere, we mourn their loss among all those who perished. May their memory be a blessing.
(1/4) Awesome breakthrough from Anthropic+@pinkfloydie+@firebat03!
Many other conjectures (e.g., SETH) are very plausibly also false.
Nonetheless, here is a short thread about what seems to have made this problem especially "ripe for AI" (in hindsight).
arxiv.org/abs/2610.06783v1
UK Greens, who polled at 20%, just cemented antisemitism and the objective of destroying Israel into their charter. Labour repeatedly copies their insane policies for votes. Open and proud Antisemitism across Europe, 3 generations after nearly eradicating its Jewry, is abhorrent.
Uploads to core TCS categories jumped, but not yet absurdly so: seems like +50%, consistent with the increase in conference submissions even pre-gpt5.6. Also visible in this graph: the labs may have solved a millennium problem, but not the inclination for absurd prompt-references
In a (small) revision, I extend the (2-eps_k)^n algorithm from k-coloring and k-list-coloring over a bounded-size palette, to also work for k-list-coloring over an unbounded palette.
arxiv.org/abs/2607.25973
Suppose you receive the elements of a permutation of [n] one by one. How much space do you need to compute its parity? Decide whether it contains a given fixed-size pattern? Decide whether it is a BST traversal?
arxiv.org/abs/2609.09064
(with Mark Braverman)
