再论信息距离
Information Distance Revisited
摘要:
我们考虑由Bennett,Gács,Li,Vitanyi和Zurek [1]引入的两个对象x和y之间的信息距离的概念,作为从y计算x以及从x计算y的程序的最小长度,并研究这个概念的不同版本。Mahmud [11]声称信息距离的前缀版本等于max(K(x| y),K(y|)+ O(1)(这个具有对数精度的等式是Bennett,Gács,Li,Vitanyi和Zurek的论文的主要结果之一)。我们表明,这种说法是错误的,但如果信息距离至少是超对数。
英文摘要:
We consider the notion of information distance between two objects x and y introduced by Bennett, Gács, Li, Vitanyi, and Zurek [1] as the minimal length of a program that computes x from y as well as computing y from x, and study different versions of this notion. It was claimed by Mahmud [11] that the prefix version of information distance equals max(K(x|y), K(y|) + O(1) (this equality with logarithmic precision was one of the main results of the paper by Bennett, Gács, Li, Vitanyi, and Zurek). We show that this claim is false, but does hold if the information distance is at least super logarithmic.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。