Examples of using Kolmogorov in English and their translations into Ukrainian
{-}
-
Colloquial
-
Ecclesiastic
-
Computer
Kolmogorov and S. V.
Directed by: Aleksey Kolmogorov.
The Kolmogorov Medal.
Written by: Aleksey Kolmogorov.
Kolmogorov A N Mathematics.
Written by: Aleksey Kolmogorov.
Even Kolmogorov investigated the issues of AI.
The Brouwer- Heyting- Kolmogorov.
Kolmogorov- Sinai entropy(eKS) was calculated. 5. Statistical analysis.
Mi T Institute Ukraine Kolmogorov- Sinai.
Kolmogorov complexity depends on what computer language is used.
Reliability of differences in groups was evaluated by Kolmogorov- Smirnov criterion.
Andrei Nikolaevich Kolmogorov- Soviet mathematician, one of the greatest mathematicians of the XX century.
A valuable soldier for the Ukrainian army,” said his former commander Yelisiy Makhov about Kolmogorov.
Group classification of a class of Kolmogorov equations with time-dependent coefficients.
The equation was arrived at independently by both the British mathematician Sydney Chapman andthe Russian mathematician Andrey Kolmogorov.
Andrei Kolmogorov included this approach(together with set theory) as part of a proposal for geometry teaching reform in Russia.
The received data are agreed with the corresponding data on the Lyapunov dimension spectrum,Kalane-York dimension and Kolmogorov entropy.
Equations similar to known Kolmogorov equations for Markov random process have been obtained for hyper-random Markov process.
On classical fundamentalsolutions of the Cauchy problem for ultraparabolic equations of Kolmogorov type with two groups of spatial variables.
It can be shown that the Kolmogorov complexity of any string cannot be more than a few bytes larger than the length of the string itself.
On the other hand, it has also been proven that there is no algorithm todetermine whether a file is incompressible in the sense of Kolmogorov complexity.
We compare this measure of proximity with the Kolmogorov- Smirnov and Wilcoxon statistics for samples from various populations.
Kolmogorov complexity is a theoretical generalization of this idea that allows the consideration of the information content of a sequence independent of any particular probability model;
Now you should check the series ofindicators on the level of agreement on the criteria of Pearson's, Kolmogorov, or Romanowski for a given level of error probability alpha.
Using the ideas of Kolmogorov complexity, one can consider the mutual information of two sequences independent of any probability distribution.
The Lyapunov dimensions spectrum is reconstructed andon its basis there are calculated the Kaplan-York dimensions and Kolmogorov entropy, which is reversely proportional to a limit of the prediction.
The reliability of index differences in the groups was estimated by Kolmogorov- Smirnov's criterion, the correlation analysis was carried by means of Pearson's linear correlation coefficient.