And I guess you can’t just enumerate all programs and take the length of the shortest (=first) one that produces the string because of the halting problem?
I wonder if I could turn that around and spin a computation of complexity into a halting oracle...
And I guess you can’t just enumerate all programs and take the length of the shortest (=first) one that produces the string because of the halting problem?
I wonder if I could turn that around and spin a computation of complexity into a halting oracle...