Difference between revisions of "Haskell Quiz/Goedel"
Jump to navigation
Jump to search
(No difference)
|
Latest revision as of 22:44, 11 February 2008
This quiz involved a sort of encryption via Goedel numbering. A message is encoded by finding the product of all p_n^m_n, where p_n is the nth prime, and m_n is the ascii value of the nth character in the message. The task was to create a program to both encode and decode messages for this format.