| D. Schweizer and Y. Abu-Mostafa. Kolmogorov metric spaces. Manuscript, Computer Science, 256-80, California Institue of Technology, Pasadena, 1988. |
....previous results on this issue which are comparable. Informally, E(x; y) is the optimal thermodynamic cost of computing y from x, and K(xjy) is the length of the shortest effective description of x given y. At least in [5] Kolmogorov complexity was used in the analysis of reversible computing. In [19] a Kolmogorov complexity based metric for picture similarity was proposed (which is too complex) without clear justification or further results. One of us, stimulated by that paper, proposed (but did not publish) the proper definition K(xjy) K(yjx) of universal cognitive measure (presented in ....
D. Schweizer and Y. Abu-Mostafa. Kolmogorov metric spaces. Manuscript, Computer Science, 256-80, California Institue of Technology, Pasadena, 1988.
....results on this issue which are comparable. Informally, E(x; y) is the optimal thermodynamic cost of computing y from x, and K(xjy) is the length of the shortest effective description of x given y. At least in [5] Kolmogorov complexity was used in the analysis of reversible computing. In [20] a Kolmogorov complexity based metric for picture similarity was proposed (which is too complex) without clear justification or further results. One of us, stimulated by that paper, proposed (but did not publish) the proper definition K(xjy) K(yjx) of universal cognitive measure (presented in ....
D. Schweizer and Y. Abu-Mostafa. Kolmogorov metric spaces. Manuscript, Computer Science, 256-80, California Institue of Technology, Pasadena, CA 91125, 1988.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC