Explain SMBC — the wiki for Saturday Morning Breakfast Cereal

The Joke

A woman at a podium announces a corollary: all NP-hard problems are the same. If you have a solution to one NP-hard problem, it stupidly solves them all. She calls this the "Collapsion." She then demonstrates: if you collapse the Travelling Salesman Problem (finding the shortest route) with a singularity, there is no space, so the salesman has nowhere to go — "SOLVED!" She applies the same logic to the Packing Problem (fitting boxes efficiently): if you collapse the universe, everything is the same size — "SOLVED!" She tackles the Halting Problem: does a program ever stop? If time does not exist, the program cannot run, and thus must halt — "SOLVED!" A man in the audience asks, "Do you know anything about mathematics?" She replies, "That is beyond the scope of this talk."

The Humor

The comic parodies academic conference presentations and the famous P vs. NP problem in computer science. The speaker's "Collapsion" is a completely nonsensical approach: she "solves" famously intractable computational problems by collapsing the universe into a singularity, eliminating the physical conditions that make the problems meaningful. The Travelling Salesman Problem is "solved" because there is no space to travel through. The Packing Problem is "solved" because everything is the same size. The Halting Problem is "solved" because time ceases to exist. Each solution is technically true in a vacuous sense but completely useless — the problems are "solved" only by destroying the context in which they matter. The punchline — "Do you know anything about mathematics?" / "That is beyond the scope of this talk" — perfectly captures a common deflection in academic Q&A sessions, where presenters dodge fundamental criticisms by claiming they fall outside the presentation's scope.

References

• P vs. NP is one of the most important unsolved problems in computer science and mathematics, concerning whether every problem whose solution can be quickly verified can also be quickly solved.
• The Travelling Salesman Problem, Packing Problem, and Halting Problem are all well-known problems in computer science, the first two being NP-hard and the third being provably undecidable.
• The concept of a singularity (collapsing the universe to a point) is borrowed from physics/cosmology.