May 16, 2026
Tree-mendous chaos in the comments
The Third Hard Problem
Coders declare a shocking new “hard problem” and the comments instantly spiral
TLDR: The article argues there’s a hidden third impossible problem in computing: squeezing messy connected ideas into neat folder-like structures. Commenters immediately turned it into a comedy brawl, debating whether the real enemy is off-by-one mistakes, time zones, or just the fact that nothing fits cleanly anywhere.
A programmer dropped a surprisingly relatable bombshell on the internet: maybe computer science doesn’t just have the two famous impossible headaches — naming things and clearing out old data at the right time — but a third one too. The new villain? Trying to force messy, tangled information into neat little folders and boxes. In plain English: real life is a web, but our computers keep pretending it’s a filing cabinet. The article walks through everything from dentist bills to app folders to why Linux scatters one program’s pieces all over your machine, all to argue that humans love tidy hierarchies even when ideas stubbornly refuse to behave that way.
And the community? Oh, they pounced. One camp basically nodded along with a weary "yes, this is painfully true," with adampunk giving the most understated endorsement possible: this is truer than people want to admit. But the real fun came from the nitpickers, jokers, and chaos agents. mcphage resurrected the classic nerd punchline about there actually being three hard problems already, thanks to off-by-one errors. ToniDoni barged in with the eternal crowd-pleaser: time zones, because no online discussion about difficult computer problems is complete without someone invoking the clock-based apocalypse. Then et1337 went full philosopher, suggesting all these “different” problems may secretly be the same problem: deciding whether two things are actually the same. And in peak comment-section fashion, aleksiy123 swept in with the most hilariously simple solution of all: "Use multiple trees." Problem solved? Absolutely not. Comment gold? Definitely.
Key Points
- •The article proposes a “third hard problem” in computer science: mapping graph-like information onto hierarchical tree structures.
- •It argues that hierarchies are well suited to physical space and many computing tasks but are a poor fit for interconnected information.
- •Trees are described as widely used in computing, with examples including B-trees, k-d trees, and abstract syntax trees.
- •Digital filing and filesystems force items into one hierarchy even when they belong to multiple categories simultaneously.
- •The article uses Linux packaging versus bundle-based approaches such as macOS-style apps, Snap, and Flatpak to show practical trade-offs in hierarchical organization.