The Normalized Algorithmic Information Distance Can Not Be Approximated

DOI10.1007/978-3-030-50026-9_9OpenAlexW3037467581MaRDI QIDQ5042235FDOQ5042235

Authors: B. Bauwens, Ilya Blinnikov 

Publication date: 19 October 2022

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.06683

zbMATH Keywords

Kolmogorov complexitycomputability theoryoscillation hierarchyalgorithmic information distance

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Information distance
• Complexity of complexity and strings with maximal plain and prefix Kolmogorov complexity
• Title not available (Why is that?)
• Kolmogorov Complexity and Algorithmic Randomness
• Nonapproximability of the normalized information distance
• An introduction to Kolmogorov complexity and its applications
• Normalized information distance and the oscillation hierarchy
• Title not available (Why is that?)

Cited In (1)

• Normalized information distance and the oscillation hierarchy

This page was built for publication: The Normalized Algorithmic Information Distance Can Not Be Approximated

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5042235)