THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS

@inproceedings{Zvonkin1970THECO,
  title={THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS},
  author={Alexander Zvonkin and Leonid A. Levin},
  year={1970}
}
In 1964 Kolmogorov introduced the concept of the complexity of a finite object (for instance, the words in a certain alphabet). He defined complexity as the minimum number of binary signs containing all the information about a given object that are sufficient for its recovery (decoding). This definition depends essentially on the method of decoding. However, by means of the general theory of algorithms, Kolmogorov was able to give an invariant (universal) definition of complexity. Related… CONTINUE READING
Highly Influential
This paper has highly influenced 31 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 589 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

589 Citations

02040'75'85'96'07'18
Citations per Year
Semantic Scholar estimates that this publication has 589 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 27 references

Die Wiederspruchsfreiheit des Kollektivbegriffs der Wahrscheinlichkeitsrechnung

  • A. Wald
  • Ergebnisse eines mathematischen Kolloquiums
  • 1937
Highly Influential
3 Excerpts

A variant of the Kolmogorov notion of complexity

  • D. W. Loveland
  • Preprint
  • 1970

Complexity and the frequency solution of certain algorithmically unsolvable queuing problems

  • Ya.M. Barzdin
  • Preprint
  • 1970
1 Excerpt

Nauka

  • A. I. Mai' tsev, Algoritmy i rekursivnye funktsii
  • MOSCOW . MR 34 # 2453. Translation: Algorithms…
  • 1970
2 Excerpts

On algorithms, frequency and randomness

  • V. N. Agafonov
  • Ph.D. dissertation, Novosibirsk
  • 1970

On the complexity of enumeration and decision of predicates

  • M. I. Kanovich
  • Dokl. Akad. Nauk SSSR
  • 1970

On the relative frequency of solution of algorithmically ununsolvable queuing problems, Dokl

  • Ya.M. Barzdin
  • Akad. Nauk SSSR
  • 1970

On the variation of complexity of infinite binary sequences

  • P. Martin-Lof
  • 1970
1 Excerpt

Algorithms connected with predicates and Boolean functions, Dokl

  • N. V. Petri
  • Akad. Nauk SSSR
  • 1969

Marandzhyan, On certain properties of asymptotically optimal recursive function, Izv

  • G. B. fo
  • Akad. Nauk Armyan. SSSR U-
  • 1969