How is it possible to measure how much work there is in a program? How much work is needed to build a program ?
It is clear , the solution is its Kolmogorov Complexity . This value gives you exactly how much work there is into the program . There is only a problem it is not computable.
The interesting thing is that from a strictly pragmatic point of view the size of the program , the lines of source code is a good K.C. approximation so the simple idea to watch on the size of the program is not a so bad idea. The problem is if the programmer know this measure , in this case the program will be written to be longest as possible and in this case the size is not a good approximation .
The conclusion is that the measure of the size of a program is a good measure if it is not written to be long.
p.s. despite the conclusion I find the short programs are so beautiful