Two decades of applied Kolmogorov complexity: in memoriam Andrei Nikolaevich Kolmogorov 1903-87

@article{Li1988TwoDO,
  title={Two decades of applied Kolmogorov complexity: in memoriam Andrei Nikolaevich Kolmogorov 1903-87},
  author={Ming Li and Paul M. B. Vit{\'a}nyi},
  journal={[1988] Proceedings. Structure in Complexity Theory Third Annual Conference},
  year={1988},
  pages={80-101}
}
  • Ming Li, P. Vitányi
  • Published 14 June 1988
  • Computer Science
  • [1988] Proceedings. Structure in Complexity Theory Third Annual Conference
The authors provide an introduction to the main ideas of Kolmogorov complexity and survey the wealth of useful applications of this notion. It is based on a theory of information content of strings, intuitively, that the amount of information in a finite string is the size (i.e. number of bits) of the smallest program that, started with a blank memory, computes the string and then terminates. The following are treated: (1) application of the fact that some strings are compressible; this… 

On the complexity of learning minimum time-bounded Turing machines

  • K. Ko
  • Mathematics, Computer Science
    COLT '90
  • 1990
TLDR
It is shown that for certain variations of the problems, they could be either polynomial-time computable or not polynomially computable, depending on different oracles, and the approach of relativization is attacked.

Kolmogorov Complexity, Restrited Nondeterminism and Generalized Spectra

TLDR
The technique of generalized spectra and expressibility of complexity classes in logic, developed by Fagin and Immerman, is used to give alternate characterizations of specific subclasses of NP, showing that relatively easy subsets of NP−P can not be pseudorandomly generated.

Inductive reasoning and Kolmogorov complexity

  • Ming LiP. Vitányi
  • Computer Science
    [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference
  • 1989
TLDR
The thesis is developed that Solomonoff's method is fundamental in the sense that many other induction principles can be viewed as particular ways to obtain computable approximations to it.

The generalized Kolmogorov complexity of sets

  • E. Allender
  • Mathematics
    [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference
  • 1989
TLDR
The author deals with the function K/sub L/, which measures the complexity of the simplest strings in the language L and with sets of the form KU/sub v/(s(n),t(n)), which consists of strings with unique short descriptions.

A New Approach to Formal Language Theory by Kolmogorov Complexity

TLDR
A new proof, using Kolmogorov complexity, of Yao and Rivest's result that k + 1 heads are better than k heads, and an alternative for pumping lemma(s) and a new characterization for regular languages are given.

Philosophical Issues in Kolmogorov Complexity

TLDR
This essay is not meant to be an exhaustive survey of the subject, not even of the recent results, but to convey to the reader some appealing philosophical ideas by just picking up some pretty shells deposited on the shore by the sea of applications of Kolmogorov complexity.

Random Languages for Non-uniform Complexity Classes

TLDR
A diierent method using strings with high generalized Kolmogorov complexity with results for the special case of P=poly-random languages in EXPSPACE is explored.

On the instance complexity of NP-hard problems

  • P. Orponen
  • Computer Science, Mathematics
    Proceedings Fifth Annual Structure in Complexity Theory Conference
  • 1990
TLDR
The t-bounded instance complexity of a string x with respect to a set A, ic/sup t/(x:A), is defined as the size of the smallest program that runs in time t, decides x correctly, and makes no mistakes on other strings.

Counting prime polynomials and measuring complexity and similarity of information

TLDR
An analogue of the prime number theorem for polynomials over night as well as its connection to the necklace factorization algorithm T-transform and the string complexity measure T-complexity are explored.
...

References

SHOWING 1-10 OF 63 REFERENCES

Kolmogorov information and vlsi lower bounds

TLDR
An intuitively appealing information-theoretic argument is presented that on-line Turing machine reversal speedup is possible if and only if reversal growth rate is strictly greater than order log(,2)n+c on input of length n for some fixed constant c.

Generalized Kolmogorov complexity and the structure of feasible computations

  • J. Hartmanis
  • Computer Science, Mathematics
    24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
  • 1983
TLDR
A generalized, two-parameter, Kolmogorov complexity of finite strings is defined which measures how much and how fast a string can be compressed and it is shown that this string complexity measure is an efficient tool for the study of computational complexity.

A Survey of the Theory of Random Sequences

TLDR
By introducing the concept of a universal algorithm Kolmogorov gave a rigorous definition of program complexity which no more depends on the choice of a special machine (or algorithm).

The Definition of Random Sequences

Information-Theoretic Limitations of Formal Systems

TLDR
An attempt is made to apply information-theoretic computational complexity to meta-mathematics by measuring the difficulty of proving a given set of theorems, in terms of the number of bits of axioms that are assumed, and the size of the proofs needed to deduce the theoremic proofs.

An Optimal Lower Bound for Turing Machines with One Work Tape and a Two- way Input Tape

TLDR
This paper contains the first concrete lower bound argument for Turing machines with one work tape and a two-way input tape and proves an optimal lower bound of Ω(n3/2/(log n)1/2) for transposing a matrix with elements of bit length ∘(logn) (where n is the length of the total input).

On the Length of Programs for Computing Finite Binary Sequences

TLDR
An application to the problem of defining a patternless sequence is proposed in terms of the concepts here developed to study the use of Turing machines for calculating finite binary sequences.

On the Length of Programs for Computing Finite Binary Sequences: statistical considerations

TLDR
An attempt is made to carry out a program for defining the concept of a random or patternless, finite binary sequence, and for subsequently defining arandom or patterned, infinite binary sequence to be a sequence whose initial segments are all random orpatternless finite binary sequences.

Succinct representation random strings, and complexity classes

  • G. Peterson
  • Computer Science, Mathematics
    21st Annual Symposium on Foundations of Computer Science (sfcs 1980)
  • 1980
TLDR
A general paradigm for relating measures of succinctness of representation and complexity theory is presented, based on the new Private and Blindfold Alternation machines, and the basic hierarchy theorems given allow different and possibly more powerful approaches to these problems.
...