@amitc1.bsky.social
Reposted
The inaugural Computational Complexity Conference Test of Time Award seeks nominations (deadline Monday, March 2, 2026). Help us select an awesome paper for this award!
computationalcomplexity.org/tot/tot26.html
computationalcomplexity.org/tot/tot26.html
Computational Complexity Conference
computationalcomplexity.org
November 10, 2025 at 5:36 PM
The inaugural Computational Complexity Conference Test of Time Award seeks nominations (deadline Monday, March 2, 2026). Help us select an awesome paper for this award!
computationalcomplexity.org/tot/tot26.html
computationalcomplexity.org/tot/tot26.html
Quicksort as IKEA-style instructions
idea-instructions.com/quick-sort/
idea-instructions.com/quick-sort/
KVICK SÖRT
Quicksort is an efficient sorting algorithm based on a divide and conquer approach. Choosing the dividing element at random is a good strategy to avoid bad worst-case runtime.
idea-instructions.com
September 25, 2025 at 1:50 AM
Quicksort as IKEA-style instructions
idea-instructions.com/quick-sort/
idea-instructions.com/quick-sort/
Reposted
What a fantastic accomplishment -- and what a fantastic story! www.quantamagazine.org/at-17-hannah...
At 17, Hannah Cairo Solved a Major Math Mystery | Quanta Magazine
After finding the homeschooling life confining, the teen petitioned her way into a graduate class at Berkeley, where she ended up disproving a 40-year-old conjecture.
www.quantamagazine.org
August 3, 2025 at 12:13 PM
What a fantastic accomplishment -- and what a fantastic story! www.quantamagazine.org/at-17-hannah...
Reposted
My thoughts on the crucial importance of methodology on self-reported AI performance on mathematics competitions, and my policy on commenting on such reports going forward: mathstodon.xyz/@tao/1148814...
Terence Tao (@tao@mathstodon.xyz)
It is tempting to view the capability of current AI technology as a singular quantity: either a given task X is within the ability of current tools, or it is not. However, there is in fact a very wid...
mathstodon.xyz
July 19, 2025 at 10:37 PM
My thoughts on the crucial importance of methodology on self-reported AI performance on mathematics competitions, and my policy on commenting on such reports going forward: mathstodon.xyz/@tao/1148814...
Reposted
Wanna see something cool?
At the Grammy's in 1976, Ella Fitzgerald and Mel Torme explained what jazz is.
The result? The crowd losing its mind. 🔥
At the Grammy's in 1976, Ella Fitzgerald and Mel Torme explained what jazz is.
The result? The crowd losing its mind. 🔥
May 4, 2025 at 1:49 AM
Wanna see something cool?
At the Grammy's in 1976, Ella Fitzgerald and Mel Torme explained what jazz is.
The result? The crowd losing its mind. 🔥
At the Grammy's in 1976, Ella Fitzgerald and Mel Torme explained what jazz is.
The result? The crowd losing its mind. 🔥
Reposted
I had an interesting experience yesterday, where my public-facing and scholarly worlds intersected, really collided. There were some fireworks.
Now I'm stuck in an airport on a layover, so I'm going to write about that experience. It happened at this talk at CSU Bakersfield #highered #academiclife
Now I'm stuck in an airport on a layover, so I'm going to write about that experience. It happened at this talk at CSU Bakersfield #highered #academiclife
April 26, 2025 at 4:06 PM
I had an interesting experience yesterday, where my public-facing and scholarly worlds intersected, really collided. There were some fireworks.
Now I'm stuck in an airport on a layover, so I'm going to write about that experience. It happened at this talk at CSU Bakersfield #highered #academiclife
Now I'm stuck in an airport on a layover, so I'm going to write about that experience. It happened at this talk at CSU Bakersfield #highered #academiclife
Let W(n,d) = number of 2n-length walks on d-dim integer lattice starting from 0 that return to 0. Clearly W(n,1) = C(2n,n). Find a cute proof that W(n,2) = C(2n,n)^2. [h/t DeepC]
December 3, 2024 at 7:38 PM
Let W(n,d) = number of 2n-length walks on d-dim integer lattice starting from 0 that return to 0. Clearly W(n,1) = C(2n,n). Find a cute proof that W(n,2) = C(2n,n)^2. [h/t DeepC]
A wonderful talk (as is usual for Kasper).
Recorded an extended version of my MFCS'24 invited talk. The talk presents my personal experiences in entering learning theory with a TCS background. The target audience is mostly TCS researchers. Hope some of you might enjoy it.
youtu.be/ZYe2mITwww4
youtu.be/ZYe2mITwww4
From Theoretical Computer Science to Learning Theory
YouTube video by Kasper Green Larsen
youtu.be
November 22, 2024 at 9:28 PM
A wonderful talk (as is usual for Kasper).