6 ms·
You'd have to determine if a program halts. Unless you restrict to non-Turing-complete language, this is undecidable.
by g__ 17y ago
You'd have to determine if a program halts. Unless you restrict to non-Turing-complete language, this is undecidable.
- eru 17y agoI can decide if some programs halt. (Just not for all.)
- jcl 17y agoYou 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.