November 25, 2025

Infinity Wars: Set vs Type vs Code

A New Bridge Links the Math of Infinity to Computer Science

Math meets coding: infinity crashes the party and the comments go feral

TLDR: A mathematician linked questions about endless sets to how computer networks communicate, creating a practical bridge between math and coding. The comments exploded into a three-way brawl: type theory vs set theory, whether CS already handles infinity, and skeptics who deny infinity exists—making the breakthrough both useful and polarizing.

Mathematics just slid into Computer Science’s DMs: Anton Bernshteyn found a way to turn thorny questions about weird, endless sets into how computers in a network talk to each other. Researchers are thrilled, but the comments section went full soap opera. One camp cheers Quanta’s story as a crossover event; another screams, “What about Type Theory?” and wants the spotlight on type theory, not set theory.

Then came the infinity fight. A confident “Finally—we can calculate infinity” got roasted by a correction crew insisting computer science already wrestles with the infinite, not just the finite. One skeptic declared, “math would be better without infinity,” triggering eye-rolls and think pieces in the replies. Meanwhile, programmers chimed in with memes like “It’s cons’es all the way down” — a nerdy wink at list-building in Lisp.

Under the drama, the news is simple: the bridge lets mathematicians and coders swap tools, prove new theorems, and rethink how we classify the infinite. It’s nerd détente with a dash of chaos. Whether you’re Team Sets, Team Types, or Team “Infinity Isn’t Real,” the vibe is the same: big brains meeting bigger opinions. Grab popcorn—the math-coding crossover episode just got renewed for seasons and more debates.

Key Points

  • In 2023, Anton Bernshteyn showed an equivalence between problems about certain infinite sets and computer network communication problems.
  • The result surprised both set theorists and computer scientists due to differing frameworks (logic vs algorithms; infinite vs finite).
  • Researchers are now using the bridge to prove new theorems, extend it to more problem classes, and reorganize aspects of descriptive set theory.
  • Bernshteyn’s entry into the field was influenced by Anush Tserunyan’s logic course at the University of Illinois; he is now at UCLA.
  • Historical context explains cardinality and measure, including Lebesgue measure, to clarify how mathematicians compare sizes of sets.

Hottest takes

“What the hell. What about Type Theory?” — k_bx
“computer science is very concerned with the infinite.” — anon291
“math would be better without infinity. It doesn’t exist.” — alexnewman
Made with <3 by @siedrix and @shesho from CDMX. Powered by Forge&Hive.