Information distance

IEEE Transactions on Information Theory

Volumn 44, Issue 4, 1998, Pages 1407-1423

  Bennett, Charles H ^a   Gâcs, Péter ^b   Li, Ming ^c   Vitânyi, Paul M B ^d   Zurek, Wojciech H ^e  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b BOSTON UNIVERSITY   (United States)

^c UNIVERSITY OF WATERLOO   (Canada)

^d CWI   (Netherlands)

^e LOS ALAMOS NATIONAL LABORATORY   (United States)

Author keywords

Algorithmic information theory; Description complexity; Entropy; Heat dissipation; Information distance; Information metric; Irreversible computation; Kolmogorov complexity; Pattern recognition

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; CORRELATION METHODS; ENTROPY; HEAT LOSSES; PATTERN RECOGNITION; THEOREM PROVING;

ALGORITHMIC INFORMATION THEORY; IRREVERSIBLE COMPUTATIONS; KOLMOGOROV COMPLEXITY; UNIVERSAL COGNITIVE DISTANCE;

INFORMATION THEORY;

EID: 0032124110     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.681318     Document Type: Article

References (28)

1. P. A. Benioff, "Quantum mechanical Hamiltonian models of discrete processes that erase their histories: Applications to Turing machines," Int. J. Theoret. Phys.. vol. 21, pp. 177-202, 1982.
2. _, "Quantum mechanical Hamiltonian models of computers," Ann. New York Acad. Sei., vol. 480, pp. 475-486, 1986.
3. C. H. Bennett, "Logical reversibility of computation," IBM J. Res. Develop., vol. 17, pp. 525-532, 1973.
4. _, "The thermodynamics of computation-A review," Int. J. Theoret. Phys.. vol. 21, pp. 905-940, 1982.
5. _, "Time/space trade-offs for reversible computation," SIAM. J. Comput.. vol. 18, pp. 766-776, 1989.
6. C. M. Caves, W. G. Unruh, and W. H. Zurek, "Comment on quantitative limits on the ability of a Maxwell Demon to extract work from heat," Phys. Rev. Lett., vol. 65, p. 1387, 1990.
7. G. Chaitin, "A theory of program size formally identical to information theory," J. Assoc. Comput. Mach., vol. 22, pp. 329-340, 1975.
8. I. Csiszâr and J. Körner, Information Theory. New York: Academic, 1980.
9. A. N. Kolmogorov, "Three approaches to the definition of the concept 'quantity of information'," Probl. Inform. Transm., vol. 1, no. 1, pp. 1-7, 1965.
10. R. P. Feynman, "Quantum mechanical computers," Opt. News, vol. 11, p. 11, 1985.
11. E. Fredkin and T. Toffoli, "Conservative logic," Int. J. Theoret. Phys., vol. 21, no. 3/4, pp. 219-253, 1982.
12. P. Gâcs and J. Körner, "Common information is far less than mutual information," Probl. Contr. and Infotm. Theory, vol. 2, pp. 149-162, 1973.
13. P. Gâcs, "On the symmetry of algorithmic information," Sov. Math.-Dokl, vol. 15, pp. 1477-1480, 1974, correction, ibid., vol. 15, p, 1480, 1974.
14. _, "Lecture notes on descriptional complexity and randomness technical report 87-103," Comp. Sei. Dept., Boston Univ., 1987.
15. R. W. Keyes and R. Landauer, "Minimal energy dissipation in logic," IBM J. Res. Develop., vol. 14, pp. 152-157, 1970.
16. R. Landauer, "Irreversibility and heat generation in the computing process," IBM J. Res. Develop., pp. 183-191, July 1961.
17. _, Int. J. Theor. Phys., vol. 21, p. 283, 1982.
18. Y. Lecerf, "Machines de Turing reversibles. Recursive insolubilité en ra g JV de l'équation u = 0 ou 0 est un "isomorphism des codes," Compt. Rend., vol. 257, pp. 2597-2600, 1963.
19. R. Y. Levine and A. T. Sherman, "A note on Bennett's time-space trade-off for reversible computation," SIAM. J. Comput., vol. 19, pp. 673-677, 1990.
20. M. Li and P. M. B. Vitânyi, "Reversibility and adiabatic computation: Trading time and space for energy," Proc. Royal Soc. London, Ser. A, vol. 452, pp. 769-789, 1996.
21. M. Li, J. Tromp, and L. Zhang, "On the neirest neighbor interchange distance between evolutionary trees," J. Theor. Biol., vol. 182, pp. 463-467, 1996.
22. M. Li and P. M. B. Vitânyi, An Introduction to Kolmogorov Complexity and Its Applications, 2nd ed. New York: Springer-Verlag, 1997.
23. K. Likharev, "Classical and quantum limitations on energy consumption on computation," Int. J. Theoret. Phys., vol. 21, pp. 311-326, 1982.
24. D. Sleator, R. Tarjan, and W. Thurston, "Short encodings of evolving structures," SIAM J. Discr. Math., vol. 5, pp. 428-450, 1992.
25. J. Ziv and N. Merhav, "A measure of relative entropy between individual sequences with application to universal classification," IEEE Trans. Inform. Theory, vol. 39, pp. 1270-1279, July 1993.
26. W. H. Zurek, "Thermodynamic cost of computation, algorithmic complexity and the information metric," Nature, vol. 341, pp. 119-124, 1989.
27. _, "Algorithmic randomness and physical entropy," Phys. Rev., vol. A40, pp. 4731751, 1989.
28. A. K. Zvonkin and L. A. Levin, "The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms," Russ. Math. Surv., vol. 25, no. 6, pp. 83-124, 1970.