Conditional automatic complexity and its metrics
Formal Languages and Automata Theory
2023-09-01 v1 Logic
Abstract
Li, Chen, Li, Ma, and Vit\'anyi (2004) introduced a similarity metric based on Kolmogorov complexity. It followed work by Shannon in the 1950s on a metric based on entropy. We define two computable similarity metrics, analogous to the Jaccard distance and Normalized Information Distance, based on conditional automatic complexity and show that they satisfy all axioms of metric spaces.
Cite
@article{arxiv.2308.16292,
title = {Conditional automatic complexity and its metrics},
author = {Bjørn Kjos-Hanssen},
journal= {arXiv preprint arXiv:2308.16292},
year = {2023}
}
Comments
29th International Computing and Combinatorics Conference (COCOON 2023), Lecture Notes in Computer Science