Quick search Find article
Quick search
Find article

Combinatorial foundations of information theory and the calculus of probabilities

REVIEW ARTICLE

A N Kolmogorov



CONTENTS
§ 1. The growing role of finite mathematics
§ 2. Information theory
§ 3. The definition of "complexity"
§ 4. Regularity and randomness
§ 5. The stability of frequencies
§ 6. Infinite random sequences
§ 7. Relative complexity and quantity of information
§ 8. Barzdin's theorem
§ 9. Conclusion
References


MSC

60C05 Combinatorial probability

60G57 Random measures

94A15 Information theory, general (See also 62B10)

Dates

Issue 4 (1983)



Users also read

What's this?
This innovative new feature generates a list of articles 'also read' by other users based on them reading the original article. Article abstracts citations and references are all considered and weighted accordingly. We hope that this will help you find relevant papers for your research.

  1. Aleksandrov and Kolmogorov in Dnepropetrovsk
  2. Andrei Nikolaevich Kolmogorov (on his eightieth birthday)
  3. Greetings to A. N. Kolmogorov from the Moscow Mathematical Society
More

View by subject




Export








Please login to access our web services, or create an account if you don't yet have one.

You must have cookies enabled in your web browser to be able to login.

Username
Password

Forgotten your password? Get a new one here.