Nonapproximability of the normalized information distance
type: Item
instance of: scholarly article
title: Nonapproximability of the normalized information distance
zbMATH Open document ID: 1215.68116
author: Sebastiaan A. Terwijn
author: Leen Torenvliet
author: Paul M. B. Vitányi
published in: Journal of Computer and System Sciences
publication date: 2011-04-28T00:00:00Z
full work available at URL: https://ir.cwi.nl/pub/19043
Mathematics Subject Classification ID: 68Q30
zbMATH DE Number: 5882192
zbMATH Keywords: normalized information distance
zbMATH Keywords: Kolmogorov complexity
zbMATH Keywords: semicomputability
MaRDI profile type: Publication
OpenAlex ID: W2099666487
Wikidata QID: Q60362747
cites work: Notes on sum-tests and independence tests
cites work: Information distance
cites work: Upper semi-lattice of binary strings with the relation ``\(x\) is simple conditional to \(y\)''
cites work: Clustering by Compression
cites work: Q3214803
cites work: The Similarity Metric
cites work: An introduction to Kolmogorov complexity and its applications
cites work: Logical operations and Kolmogorov complexity
cites work: Independent minimum length programs to translate between given strings
cites work: Information distance and conditional complexities
cites work: Systems of strings with high mutual complexity
cites work: THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
DOI: 10.1016/J.JCSS.2010.06.018
description: scientific article; zbMATH DE number 5882192