Recent Comments
-
Recent Posts
- Some News from a Seminar in Cambridge
- Subspace Designs, Unit and Distinct Distances, and Piercing Standard Boxes.
- Greg Kuperberg @ Tel Aviv University
- Israel AGT Day, Reichman University, March 5, 2023
- Alef’s Corner: Democracy (Israel, 2023)
- Absolutely Sensational Morning News – Zander Kelley and Raghu Meka proved Behrend-type bounds for 3APs
- The Trifference Problem
- Greatest Hits 2015-2022, Part II
- Greatest Hits 2015-2022, Part I
Top Posts & Pages
- Some News from a Seminar in Cambridge
- Absolutely Sensational Morning News - Zander Kelley and Raghu Meka proved Behrend-type bounds for 3APs
- Greg Kuperberg @ Tel Aviv University
- Quantum Computers: A Brief Assessment of Progress in the Past Decade
- To cheer you up in difficult times 7: Bloom and Sisask just broke the logarithm barrier for Roth's theorem!
- 'Gina Says'
- R(5,5) ≤ 48
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- Yael Tauman Kalai's ICM2018 Paper, My Paper, and Cryptography
RSS
Monthly Archives: April 2021
The probabilistic proof that 2^400-593 is a prime: a revolutionary new type of mathematical proof, or not a proof at all?
Avi Wigderson gave a great CS colloquium talk at HUJI on Monday (a real auditorium talk with an audience of about 200 people). The title of the talk was The Value of Errors in Proofs – a fascinating journey from … Continue reading