Related papers: Kolmogorov and Aleksandrov in Sevan Monastery, Arm…
These reminiscences are about the "dark ages" of algorithmic information theory in the USSR. After a great interest in this topic in 1960s and the beginning of 1970s the number of people working in this area in the USSR decreased…
The paper aim is the axiomatic justification of the theory of experience and chance, one of the dual halves of which is the Kolmogorov probability theory. The author's main idea was the natural inclusion of Kolmogorov's axiomatics of…
These personal reminiscences of the great Russian mathematician Sergey K. Godunov (1929-2023) arose from a request by his daughter, Ekaterina, to contribute a piece to a book she is writing about her father's life. I was honoured to accept…
The last theme of Kolmogorov's mathematics research was algorithmic theory of information, now often called Kolmogorov complexity theory. There are only two main publications of Kolmogorov (1965 and 1968-1969) on this topic. So Kolmogorov's…
In this paper the context of the 1940 mathematical paper by Kolmogorov on Mendel's laws of genetics is considered, also thanks to a recent study by Stark and Seneta (2011). Kolmogorov's vision of the relationship between mathematics and…
Among the impressive contributions of Andrej N. Kolmogorov's to mathematics in the 20th century, his 1954 invariant tori theorem is still little understood from a historical point of view [Dumas 2014]. Vladimir I. Arnold, who entered Moscow…
Written for the book "Mathematicians from Saint Petersburg and their theorems".
The following is an exposition of a course of algebra that Prof. Aleksandr Aleksandrovich Zykov (1922-2013) distributed among the participants of his seminar in graph theory not far away from Odessa, Ukraine, on September, 1991. It is a…
In this paper, we are interested in the teaching of probability theory in Prague and Czechoslovakia, in particular during the 1930's. We focus specially on a textbook, published in Prague by Karel Rychlik in 1938, which uses Kolmogorov's…
Andrei Kolmogorov's Grundbegriffe der Wahrscheinlichkeits-rechnung put probability's modern mathematical formalism in place. It also provided a philosophy of probability--an explanation of how the formalism can be connected to the world of…
April 25, 2003, marked the 100th anniversary of the birth of Andrei Nikolaevich Kolmogorov, the twentieth century's foremost contributor to the mathematical and philosophical foundations of probability. The year 2003 was also the 70th…
The problem of positive Kolmogorov-Sinai entropy of the Chirikov-Standard map with respect to the invariant Lebesgue measure on the two-dimensional is open. In 1999, we believed to have a proof that the entropy can be bounded below. This…
This reform was a part of a transnational movement as 'the New Math' in the United States or the activity of the Lichnerowicz commission in France. The Russian version of these events involved the whole secondary and high school (4-10…
Using Kolmogorov Game Derandomization, upper bounds of the Kolmogorov complexity of deterministic winning players against deterministic environments can be proved. This paper gives improved upper bounds of the Kolmogorov complexity of such…
Being asked to write about Asan D. Taimanov, I had a little problem. I knew Taimanov. I liked and respected him, and so I wanted to write something. But I didn't know him well. I didn't live in the Novosibirsk Akademgorodok where he lived…
This, and its sequel, concern some variations of a classical theorem of A.D. Alexandrov and teh Hopf Lemma.
At the beginning of 1930-s A. N. Kolmogorov has published three papers on analytical methods for the probability theory. The two-page work had the essence of the approach started by A. Einstein and developed further by Fokker and Planck. He…
We have used the Kolmogorov complexities, sample and permutation entropies to quantify the randomness degree in river flow time series of two mountain rivers in Bosnia and Herzegovina, representing the turbulent environmental fluid, for the…
We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: randomness and classification. The survey is divided in two parts…
A method of random search based on Kolmogorov complexity is proposed and applied to two search problems in group theory. The method is provably effective but not practical, so the applications involve heuristic approximations. Perhaps…