Ask HN: Size of a program as a measure of simplicity?
In this article http://plus.maths.org/issue37/features/omega/index.html Gregory Chaitin says that "... simplicity — or lack of it — [of scientific law] is reflected in the length of the program."
Since "the size of a computer program is the number of "bits" it contains"; Chaitin measures simplicity with the number of bits in a program.
This doesn't sound right to me. All "hello world" programs achieve the same result; but all "hello world" programs do not have the same number of bits; as far as I know.
Anyone care to comment?