Estimates of Kolmogorov complexity in approximating cantor sets
نویسندگان
چکیده
منابع مشابه
Randomized Communication Complexity of Approximating Kolmogorov Complexity
The paper [Harry Buhrman, Michal Koucký, Nikolay Vereshchagin. Randomized Individual Communication Complexity. IEEE Conference on Computational Complexity 2008: 321-331] considered communication complexity of the following problem. Alice has a binary string x and Bob a binary string y, both of length n, and they want to compute or approximate Kolmogorov complexity C(x|y) of x conditional to y. ...
متن کاملGenetic Programming Estimates of Kolmogorov Complexity
In this paper the problem of the Kolmogorov complexity related to binary strings is faced. We propose a Genetic Programming approach which consists in evolving a population of Lisp programs looking for the optimal program that generates a given string. This evolutionary approach has permited to overcome the intractable space and time diiculties occurring in methods which perform an approximatio...
متن کاملε-Distortion Complexity for Cantor Sets
We define the ε-distortion complexity of a set as the shortest program, running on a universal Turing machine, which produces this set at the precision ε in the sense of Hausdorff distance. Then, we estimate the ε-distortion complexity of various central Cantor sets on the line generated by iterated function systems (IFS’s). In particular, the ε-distortion complexity of a C Cantor set depends, ...
متن کاملOn Kolmogorov Complexity of Hard Sets
There are two main informal ideas related to informational content of hard sets. The first says that a set of low informational content can not be hard or complete for a great enough complexity class because of lack of information accessible with bounded resources. One of the formalization of this idea is well-known Hartmanis Conjecture: Sparse sets are not Ccomplete if C is great enough comple...
متن کاملKolmogorov complexity of enumerating finite sets
Solovay [5] has proved that the minimal length of a program enumerating a set A is upper bounded by 3 times the negative logarithm of the probability that a random program will enumerate A. It is unknown whether one can replace the constant 3 by a smaller constant. In this paper, we show that the constant 3 can be replaced by the constant 2 for finite sets A. We recall first two complexity meas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nonlinearity
سال: 2011
ISSN: 0951-7715,1361-6544
DOI: 10.1088/0951-7715/24/2/005