Normalized Information Distance and the Oscillation Hierarchy

We study the complexity of approximations to the normalized information distance. We introduce a hierarchy of computable approximations by considering the number of oscillations. This is a function version of the difference hierarchy for sets. We show that the normalized information distance is not in any level of this hierarchy, strengthening previous nonapproximability results. As an ingredient to the proof, we also prove a conditional undecidability result about independence.

[1]  Péter Gács,et al.  Information Distance , 1998, IEEE Trans. Inf. Theory.

[2]  Bruno Bauwens,et al.  The normalized algorithmic information distance can not be approximated , 2020, CSR.

[3]  P. Odifreddi.  Classical recursion theory , 1989 .

[4]  Rodney G. Downey,et al.  Algorithmic Randomness and Complexity , 2010, Theory and Applications of Computability.

[5]  Bin Ma,et al.  The similarity metric , 2001, IEEE Transactions on Information Theory.

[6]  Ming Li,et al.  Normalized Information Distance , 2008, ArXiv.

[7]  Sebastiaan Terwijn,et al.  Nonapproximability of the normalized information distance , 2009, J. Comput. Syst. Sci..

[8]  V. L. Selivanov,et al.  Difference Hierarchy in ϕ-Spaces , 2004 .

[9]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.

[10]  Victor L. Selivanov,et al.  Fine hierarchies and Boolean terms , 1995, Journal of Symbolic Logic.