Lawyer meme: my client couldn't have done it — that requires near-O(n log n) integer multiplication
airkatakana · x · 2026-10-07
A math/CS meme: a lawyer argues their client couldn't possibly have committed the crime, since doing so would require multiplying two n-bit integers in O(n(lg n)^(1-2^-128)) worst-case time — the near-linear integer multiplication complexity proven by Harvey and van der Hoeven. The joke lands on "theoretically possible, practically absurd" algorithm humor.
Related event: New Integer Multiplication Bound Sparks Programmer Lawyer Meme(2 posts)→
More from Fun
- Raw Lidar vs Raw RGB: Debate Erupts Over What Perception Models Actually See — reed · 2026-10-07
- Dev Uses AI Decision API to Build an Auto-Loot Filter for Diablo-like ARPGs — Dimillian · 2026-10-07
- Job post seeking 'anti-slop' writer is itself written in AI slop style — HamelHusain · 2026-10-07
- DeepMind researcher Greg Yang dumps his book collection in rough chronological order — burny_tech · 2026-10-07
- Reddit AI mod flags pasted Google data as AI slop, sparking false-positive complaints — technicalseller · 2026-10-07
- 'AI will never be good at writing' — one holdout line that's lasted longest — wordgrammer · 2026-10-07