## Abstract

V. A. Uspensky and V. V. V'yugin shared their views regarding the development of the algorithmic information theory in Russia. Kolmogorov initiated a search for the methods to construct the information theory and probability theory using a new algorithmic basis in the early 1960s. Kolmogorov proposed a method for the measurement of the complexity of object and introduced the concept that was known as the Kolmogorov complexity. The new concept was used for the construction of the algorithmic variant of the information theory in 1965, making it possible to measure the information as a finite sequence of symbols. The concept was also used to present the approach that allowed a search for the definition of a random sequence with respect to its chaoticity. R. Solomonoff proposed a concept of the universal predictor, while Solomonoff intended to construct measure M with effectively computable properties.

Original language | English |
---|---|

Pages (from-to) | 739-747 |

Number of pages | 9 |

Journal | Journal of Communications Technology and Electronics |

Volume | 56 |

Issue number | 6 |

DOIs | |

Publication status | Published - Jun 2011 |

Externally published | Yes |