geometry
.png)
.png)
Explanation
The Joke
The comic presents a math lecture about the classical problem of "squaring the circle" -- constructing a square with the same area as a given circle using only a compass and straightedge. The professor explains that mathematicians rigorously proved this is impossible. But then he introduces a twist: he asks the students to imagine expanding the problem by allowing a compass, a straightedge, AND a Turing machine (a theoretical model of computation). He further asks them to imagine replacing the geometric symbols with arbitrary symbols on the straightedge, making it a general-purpose computing device.
The punchline comes when a student asks, "Are you misusing the point accidentally or strategically?" and the professor admits, "I'm mostly trying to make the philosophy students gag." The professor has performed a bait-and-switch: he started with a classical geometry problem and gradually redefined the tools until the "compass and straightedge" construction became a general-purpose computer, which trivially renders the original geometric constraint meaningless.
The Humor
The humor works on several levels. First, the professor is deliberately trolling philosophy students by taking a well-defined mathematical problem and muddying it with redefinitions until the original question becomes meaningless -- a parody of how some philosophical arguments work by subtly redefining terms. Second, the step-by-step transformation from geometry to computer science is a genuinely clever logical sleight-of-hand that mirrors real debates about what counts as a "valid" construction in mathematics. The professor's gleeful admission that he is doing this specifically to annoy philosophy students adds a layer of interdepartmental academic rivalry humor.
References
- Squaring the circle was proven impossible in 1882 by Ferdinand von Lindemann, who showed that pi is a transcendental number, meaning it cannot be constructed with compass and straightedge alone.
- A Turing machine is a mathematical model of computation defined by Alan Turing in 1936, capable of simulating any algorithmic process.