Abstract
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 a finite-valued fuzzy language through a universal finite-valued fuzzy Turing machine that produces the desired fuzzy language. The classical Kolmogorov complexity is extended to the fuzzy domain retaining classical descriptions. We show that our definition is robust, that is to say, the complexity of a finite-valued fuzzy language does not depend on the underlying finite-valued fuzzy Turing machine.
Subject
General Physics and Astronomy
Reference35 articles.
1. A formal theory of inductive inference. Part I
2. Three approaches to the quantitative definition of information*
3. On the Length of Programs for Computing Finite Binary Sequences
4. On computable numbers, with an application to the Entscheidungs problem;Turing;Proc. Lond. Math. Soc.,1936
5. On computable numbers, with an application to the Entscheidungs problem. A Correction;Turing;Proc. Lond. Math. Soc.,1937
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献