Highly Influenced

- Published 1983 in Theor. Comput. Sci.
DOI:10.1016/0304-3975(83)90001-4

This paper extends the usual notion of abstract program size complexity, studied by Kolmogorov, Chaitin and others, to a theory that can better model the concept of a ‘practical’ compression method. The contraction of a string is defined, as in standard program size complexity, to be the shortest program which produces that string. However, this is in… CONTINUE READING

### Presentations referencing similar topics