Thermodynamics of computation and information distance
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Information distance from a question to an answer
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Information shared by many objects
Proceedings of the 17th ACM conference on Information and knowledge management
New information distance measure and its application in question answering system
Journal of Computer Science and Technology
Nonapproximability of the normalized information distance
Journal of Computer and System Sciences
Information distance and its applications
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Prefix-Free and prefix-correct complexities with compound conditions
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
| Hi-index | 5.23 |
Conditional Kolmogorov complexity K(x|y) can be understood as the complexity of the problem "Y→X", where X is the problem "construct x" and Y is the problem "construct y". Other logical operations (↑, ↓, ↔) can be interpreted in a similar way, extending Kolmogorov interpretation of intuitionistic logic and Kleene realizability. This leads to interesting problems in algorithmic information theory. Some of these questions are discussed.