2 ms·
In most cases the shortest program is the fastest, because most bitstrings are random, and the shortest program just prints the bitstring. On the other hand, f
by yters 8y ago
In most cases the shortest program is the fastest, because most bitstrings are random, and the shortest program just prints the bitstring.
On the other hand, for compressible bitstrings, the shortest program is most likely not going to be the fastest, because you need at least one operation to output each final bit, so since the shortest program is going to be doing more than just printing the output, it's probably going to take longer than just printing the output.