News for hackers. Stuff that matters.
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.
Re:9,73,241,561,1081,1849,_?_ by jcl on Thursday November 05, 2009 @07:21PM (#925145)
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.
Re:9,73,241,561,1081,1849,_?_ by eru on Thursday November 05, 2009 @05:29PM (#924934)
I can decide if some programs halt. (Just not for all.)