Biggest Breakthroughs in Computer Science: 2025

Comments · 395

• TW

  @TWPO · 7 months ago

  I used to look forward to these videos every year, but they've gotten so overly simplified that they are void of any actual information. Please put more implementation details in, your audience is not dumb.

  1.9K

• MR

  @MrSN99 · 7 months ago (edited)

  so simple and condensed i didn't understand anything

  1.1K

• TH

  @TH-lu9du · 7 months ago

  Feels like at least a year passed since 2025

  372

• MI

  @migadepancito · 7 months ago

  Don’t dumb it down!

  335

• KY

  @kylebowles9820 · 7 months ago

  It isn't "a pile of clothes on my floor", mom; it's my hash table L2 cache of clothes

  309

• RI

  @rickintexas1584 · 7 months ago

  I’m a 62 year old aeronautical engineer who occasionally has to write small programs. I learned to code back in the 70s and 80s. I don’t fully understand hash tables, but I now love them. On the last program I wrote the code took a long time to run. I swapped out a manual search algorithm I wrote by hand for a hash table lookup. The code ran in a fraction of the time. I’m going to remember that lesson for all applications in the future.

  29

• EN

  @enthusiastofchangeincanada · 7 months ago

  Honestly miraculous how this year&apos;s breakthroughs are relatable to so many things I already know (compared to some abstract math field).<br>Don&apos;t listen to other peoples complaining about how simplified these videos are, it&apos;s literally impossible to convey actual information on the latest research in a video, let alone a 20 minutes one, even with good visual storytelling. It&apos;s a good introduction and the papers are available to read (for free, iykyk).

  6

• MA

  @marikselazemaj3428 · 7 months ago

  These guys made it as simple as possible, and then some more.

  69

• BL

  @Blackwhite2277 · 7 months ago

  I was beginning to think there wasn&apos;t going to be this video for CS 🥺 So glad you uploaded it, thank you Quanta!

  17

• MA

  @magosrobertus934 · 7 months ago

  It is not clear in the video why skipping open spaces lets you do hash insertions in close to constant time. I assume it works by looking at the complete ordered lists of memory locations for each item. Then, you start with the memory location that takes the longest to appear in any list and work backwards.

  85

• AN

  @antimonark7837 · 7 months ago

  <a href="https://www.youtube.com/watch?v=DFwppvrL_pE&amp;t=705">11:45</a> his mind is cooking something

  8

• JU

  @juanmacias5922 · 7 months ago

  <a href="https://www.youtube.com/watch?v=DFwppvrL_pE&amp;t=566">9:26</a> reminded me of the XOR linked list, on how you can use adjacent addresses to deduce the next node. 😁

  8