4 ms·
When two strings have the same Kolmogorov Complexity, one of them might take significantly longer to "decompress". Shouldn't we then say that this string has hi
by mherrmann 10y ago
When two strings have the same Kolmogorov Complexity, one of them might take significantly longer to "decompress". Shouldn't we then say that this string has higher information content?
It feels to me like Kolmogorov Complexity (while very elegant) might just be a crude approximation to a measure that also takes into account the time it takes to print the string.
- cosmoharrigan 10y agoSee "Logical Depth" as defined by Charles Bennett: http://researcher.ibm.com/researcher/files/us-bennetc/UTMX.pdf http://researcher.ibm.com/researcher/files/us-bennetc/UTMX.p... as well as Chapter 7, "Resource-Bounded Complexity", from "An introduction to Kolmogorov complexity and its applications".
- mherrmann 10y agoI'll take a look. Thanks!
- mafribe 10y agoIt might be interesting for you to contemplate Schmidthuber's "speed prior". http://people.idsia.ch/~juergen/speedprior.html http://people.idsia.ch/~juergen/speedprior.html