STACS 2006: STACS 2006 pp 137-148 | Cite as
Kolmogorov Complexity with Error
Abstract
We introduce the study of Kolmogorov complexity with error. For a metric d, we define C a (x) to be the length of a shortest program p which prints a string y such that d(x,y) ≤ a. We also study a conditional version of this measure C a, b (x|y) where the task is, given a string y′ such that d(y,y′) ≤ b, print a string x′ such that d(x,x′) ≤ a. This definition admits both a uniform measure, where the same program should work given any y′ such that d(y,y′) ≤ b, and a nonuniform measure, where we take the length of a program for the worst case y′. We study the relation of these measures in the case where d is Hamming distance, and show an example where the uniform measure is exponentially larger than the nonuniform one. We also show an example where symmetry of information does not hold for complexity with error under either notion of conditional complexity.
Keywords
Turing Machine Kolmogorov Complexity Uniform Measure Covering Code Small ProgramPreview
Unable to display preview. Download preview PDF.
References
- 1.Cohen, G., Honkala, I., Litsyn, S., Lobstein, A.: Covering Codes. North-Holland, Amsterdam (1997)MATHGoogle Scholar
- 2.Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. MIT Press, Cambridge (1990)MATHGoogle Scholar
- 3.Dantsin, E., Goerdt, A., Hirsch, E., Schöning, U.: Deterministic algorithms for k-SAT based on covering codes and local search. In: Proceedings of the 27th International Colloquium On Automata, Languages and Programming. LNCS, pp. 236–247. Springer, Heidelberg (2000)CrossRefGoogle Scholar
- 4.Impagliazzo, R., Shaltiel, R., Wigderson, A.: Extractors and pseudo-random generators with optimal seed length. In: Proceedings of the 32nd ACM Symposium on the Theory of Computing, pp. 1–10. ACM, New York (2000)Google Scholar
- 5.Krivelevich, M., Sudakov, B., Vu, V.: Covering codes with improved density. IEEE Transactions on Information Theory 49, 1812–1815 (2003)MathSciNetCrossRefMATHGoogle Scholar
- 6.Li, M., Vitányi, P.: An Introduction to Kolmogorov Complexity and its Applications, 2nd edn. Springer, New York (1997)CrossRefMATHGoogle Scholar
- 7.Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1997)MATHGoogle Scholar
- 8.Natarajan, B.: Filtering random noise from deterministic signals via data compression. IEEE transactions on signal processing 43(11), 2595–2605 (1995)CrossRefGoogle Scholar
- 9.Vereschagin, N., Vitányi, P.: Algorithmic rate-distortion theory (2004), http://arxiv.org/abs/cs.IT/0411014
- 10.Zvonkin, A., Levin, L.: The complexity of finite objects and the algorithmic concepts of information and randomness. Russian Mathematical Surveys 25, 83–124 (1970)CrossRefMATHGoogle Scholar