Fuzzy Kolmogorov Complexity Based on a Classical Description
In this paper, we give a definition for fuzzy Kolmogorov complexity. In the classical setting, the Kolmogorov complexity of a single finite string is the length of the shortest program that produces this string. We define the fuzzy Kolmogorov complexity as the minimum classical description length of...
| Hovedforfatter: | |
|---|---|
| Format: | Article |
| Sprog: | English |
| Udgivet: |
MDPI AG
2020-01-01
|
| Serier: | Entropy |
| Fag: | |
| Online adgang: | https://www.mdpi.com/1099-4300/22/1/66 |