Re:9,73,241,561,1081,1849,_?_
by g__ on Thursday November 05, 2009 @04:46PM
(#924852)
You'd have to determine if a program halts. Unless you restrict to non-Turing-complete language, this is undecidable.
[ Parent
| on HN ]
You can simply modify your definition of "simplest" to be "shortest that completes in a million steps" or some such. A program that takes so long to finish that you're not sure it will return your desired value is probably not the simplest.