Fuzzy Kolmogorov Complexity Based on a Classical Description
نویسندگان
چکیده
منابع مشابه
Quantum Kolmogorov Complexity Based on Classical Descriptions
We develop a theory of the algorithmic information in bits contained in an individual pure quantum state. This extends classical Kolmogorov complexity to the quantum domain retaining classical descriptions. Quantum Kolmogorov complexity coincides with the classical Kolmogorov complexity on the classical domain. Quantum Kolmogorov complexity is upper bounded and can be effectively approximated f...
متن کاملOn the Quantum Kolmogorov Complexity of Classical Strings
We show that classical and quantum Kolmogorov complexity of binary strings agree up to an additive constant. Both complexities are defined as the minimal length of any (classical resp. quantum) computer program that outputs the corresponding string. It follows that quantum complexity is an extension of classical complexity to the domain of quantum states. This is true even if we allow a small p...
متن کاملA Survey on Kolmogorov Complexity
Kolmogorov complexity, which is also called algorithmic (descriptive) complexity is an object, such as a piece of text, to measure the computational resources needed, which are mostly the length of the shortest binary program to specify an object. Strings whose Kolmogorov complexity is small relative to the string’s size are not considered to be complex and easy to use a short program to specif...
متن کاملBounded Kolmogorov Complexity Based on Cognitive Models
Computable versions of Kolmogorov complexity have been used in the context of pattern discovery [1]. However, these complexity measures do not take the psychological dimension of pattern discovery into account. We propose a method for pattern discovery based on a version of Kolmogorov complexity where computations are restricted to a cognitive model with limited computational resources. The pot...
متن کاملSome Complexity Results on Fuzzy Description Logics
We present and discuss some novel and somewhat surprising complexity results for a basic but significant fuzzy description logic (DL) which extends the classical ALC language. In particular we show that checking the consistency of a concept or a KB in fuzzy DLs has a complexity which jumps from linear-time to EXPTIME-complete, while the subsumption problem is always (at least) as hard as in cri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Entropy
سال: 2020
ISSN: 1099-4300
DOI: 10.3390/e22010066