Cargando…
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...
Autor principal: | Dai, Songsong |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7516500/ https://www.ncbi.nlm.nih.gov/pubmed/33285841 http://dx.doi.org/10.3390/e22010066 |
Ejemplares similares
-
How Incomputable Is Kolmogorov Complexity?
por: Vitányi, Paul M.B.
Publicado: (2020) -
An introduction to Kolmogorov complexity and its applications /
por: Li, Ming 1955 Julio 16-
Publicado: (2008) -
An introduction to Kolmogorov complexity and its applications
por: Li Ming Wei, et al.
Publicado: (1997) -
A Survey on Using Kolmogorov Complexity in Cybersecurity
por: S. Resende, João, et al.
Publicado: (2019) -
Kolmogorov in perspective
por: London Mathematical Society
Publicado: (2006)