Exact Expression For Information Distance
| Authors | |
|---|---|
| Publication date | 31-10-2014 |
| Edition | 5 |
| Number of pages | 5 |
| Publisher | Ithaca, NY: ArXiv |
| Organisations |
|
| Abstract | Information distance can be defined between a string and a multiset of strings. We give an elementary proof for expressing the information distance in conditional Kolmogorov complexity. It is exact since the lower bound equals the upper bound up to a constant additive term. |
| Document type | Working paper |
| Note | Version 1 to 4 (2015), 6 to 9 (2015) and 10 (2017) also available on ArXiv.org |
| Language | English |
| Related publication | Exact Expression for Information Distance |
| Published at | https://arxiv.org/abs/1410.7328v5 |
| Downloads |
1410.7328v5
(Submitted manuscript)
|
| Permalink to this page | |