In the Unicon mailing list we worked on the problem of finding the two US states that have the same letters in their names as a different pair of states—not what states they are, which my brain figured out almost right away, but mostly on the general problem of finding word pairs that match in this way.
It turned out that the fastest algorithm the group found used Gödel numbers to represent classes of pairs of names of US states.
Not something I expected, but it takes advantage of the fact that multiplying Gödel numbers is equivalent to mixing the letters of two state names. Very cool.
(I should mention that, unlike the pitiful languages other people use, Icon/Unicon has multiple precision integers. :) )
