Site icon

The Winning Incompleteness & Unsolvable Halting Limerick

By request from several readers, here’s a reprint (from mini-AIR) of the winning entry for the Incompleteness & Unsolvable Halting Limerick Competition,

The competition asked for a limerick to honor the study “What Does the Incompleteness Theorem Add to the Unsolvability of the Halting Problem?” Torkel Franzen, Lecture Notes in Computer Science, vol. 3988, 2006, p. 198.

Here’s the winning limerick, by INVESTIGATOR WARD SILVER:

In a limerick’s incomplete ends
One can see it unsolvably bends
Turing’s logical works
With Godelian quirks
In a limerick’s incomplete ends
One can see it unsolvably bends
Turing’s logical works
With Godelian quirks
In a limerick’s incomplete ends
One can see it unsolvably bends
Turing’s logical works
With Godelian quirks
In a limerick’s incomplete ends
One can see it unsolvably bends
Turing’s logical works
With Godelian quirks
In a limerick’s incomplete ends
One can see it unsolvably bends
Turing’s logical works
With Godelian quirks
In a limerick’s incomplete ends
One can see it unsolvably bends
Turing’s logical works
With Godelian quirks
In a limerick’s incomplete ends
One can see it unsolvably bends
Turing’s logical works
With Godelian quirks
In a limerick’s incomplete ends
One can see it unsolvably bends
Turing’s logical works
With Godelian quirks

BONUS: The halting problem.

BONUS: Godel’s incompleteness theorem.

BONUS: One high school student’s take on Godel’s theorem:

Exit mobile version