On Sunday 03 June 2007 11:32, Joshua Ballanco wrote:
> Mathematically speaking, finding the shortest/optimal solution to any 
> programming challenge is an NP problem. It might be fun to do a follow 
> up quiz where the goal is to write a code generator that can find the 
> elusive 56 byte golfing solution to the FizzBuzz quiz. If one were to 
> simply write a random ASCII string generator and test every possible 56 
> byte string, it would take less than 95^56 (or 5.656e110) iterations...
> 
> ...or would that quiz be too hard?

Its much worse than NP - its uncomputable. You'd run into the halting
problem doing the tests.


-- 
Jesse Merriman
jessemerriman / warpmail.net
http://www.jessemerriman.com/