Oh alright then. spoilers.

The German gets it.

Brilliant!

There is, however, nothing to stop me from writing a program that will correctly analyze all programs of length less than or equal, say, N bytes in length. Unless you need an arbitrary-length analyzer, feel free to contact me. Rates reasonable, albeit exponential in N.

Mm, solid German-made paper.

Appreciated everywhere except in the WC.

Hi, this one here is actually a request from our QA team. In order to assess whether the code our programmers write is good, they need a program (an "elegance-testing" program, they called it) that could tell us whether the code our programming team has produced is "elegant", or the shortest program that produces a given output. It would take as input a program and output whether the program is elegant or not.

Obviously, we can't give this task to our in-house programming team (they would surely find a way to cheat - like writing a program that would output "This code is SUPER-ELEGANT" no matter what the input). The head of our QA team assures me that a program like this shouldn't be too difficult to write. He says it should take two to three weeks maximum. They'd do it themselves, but they obviously have other things to do.

(spoiler)

tee hee

It would take as input a program and output whether the program is elegant or not.

I love it.
I really really love it.

You should translate all your comments with one of those online Shakespeare translators. Make sure the word "forsooth" is plentiful. Also, write it in a British accent.