Geodesic
Combinatorial foundations of information theory and the calculus of probabilities
Trudy Matematicheskogo Instituta imeni V.A. Steklova, Tome 38 (1983) no. 4, pp. 29-40 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{RM_1983_38_4_a3,
     author = {A. N. Kolmogorov},
     title = {Combinatorial foundations of information theory and the calculus of probabilities},
     journal = {Trudy Matematicheskogo Instituta imeni V.A. Steklova},
     pages = {29--40},
     year = {1983},
     volume = {38},
     number = {4},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/RM_1983_38_4_a3/}
}
TY  - JOUR
AU  - A. N. Kolmogorov
TI  - Combinatorial foundations of information theory and the calculus of probabilities
JO  - Trudy Matematicheskogo Instituta imeni V.A. Steklova
PY  - 1983
SP  - 29
EP  - 40
VL  - 38
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/RM_1983_38_4_a3/
LA  - en
ID  - RM_1983_38_4_a3
ER  - 
%0 Journal Article
%A A. N. Kolmogorov
%T Combinatorial foundations of information theory and the calculus of probabilities
%J Trudy Matematicheskogo Instituta imeni V.A. Steklova
%D 1983
%P 29-40
%V 38
%N 4
%U http://geodesic.mathdoc.fr/item/RM_1983_38_4_a3/
%G en
%F RM_1983_38_4_a3
A. N. Kolmogorov. Combinatorial foundations of information theory and the calculus of probabilities. Trudy Matematicheskogo Instituta imeni V.A. Steklova, Tome 38 (1983) no. 4, pp. 29-40. http://geodesic.mathdoc.fr/item/RM_1983_38_4_a3/

[1] A. N. Kolmogorov, “Tri podkhoda k opredeleniyu ponyatiya “kolichestvo informatsii””, Problemy peredachi informatsii, 1:1 (1965), 3–7 | MR

[2] A. N. Kolmogoroff, “Logical basis for information theory and probability theory”, IEEE Trans., IT-14 (1968), 662–664 ; A. N. Kolmogrov, “K logicheskim osnovam teorii informatsii i teorii veroyatnostei”, Problemy peredachi informatsii, 5:3 (1969), 3–7 | MR | MR

[3] R. J. Solomonoff, “A formal theory of inductive inference”, Information and Control, 7:1 (1964), 1–22 | DOI | MR | Zbl

[4] G. J. Ghaitin, “On the length of programs for computing finite binary sequences”, J. ACM, 13:4 (1966), 547–569 | DOI | MR

[5] D. Loveland, “A new interpretation of the Mises concept of random sequence”, Z. Mathem. Logic und Grundlagen der Math., 12 (1966), 279–294 | DOI | MR | Zbl

[6] A. Church, “On the concept of random sequence”, Bull. Amer. Mathem. Soc., 46 (1940), 254–260 | MR

[7] P. Martin-Löf, “The definition of random sequences”, Information and Control, 9 (1966), 602–619 | DOI | MR

[8] P. Martin-Löf, Algorithms and random sequences, University of Erlangen, 1966

[9] C. P. Schnorr, “Eine Bemerkung zum Begriff der Zufälligen Folge”, Zeitschr. Wahrscheinlinchkeitstheorie ver. Geb., 14 (1969), 27–35 | DOI | MR | Zbl

[10] B. A. Trakhtenbrot, Slozhnost algoritmov i vychislenii, Novosibirsk, 1967

[11] A. N. Kolmogorov, V. A. Uspenskii, “K opredeleniyu algoritma”, UMN, 13:4 (1958), 3–28 | MR

[12] Ya. M. Barzdin, “Problemy universalnosti v teorii rastuschikh avtomatov”, DAN, 157:3 (1964)

[13] Yu. P. Ofman, “Universalnyi avtomat”, Trudy MMO, 14, 1965, 186–199 | MR

[14] Yu. P. Ofman, “Modelirovanie samokonstruiruyuscheisya sistemy na universalnom avtomate”, Problemy peredachi informatsii, 2:1 (1966), 68–73

[15] Ya. M. Barzdin, “Slozhnost programm, raspoznayuschikh prinadlezhnost naturalnykh chisel, ne prevyshayuschikh $n$, rekursivno perechislimomu mnozhestvu”, DAN, 182:6 (1968), 1249–1252 | MR | Zbl

[16] A. K. Zvonkii, L. A. Levin, “Slozhnost ob'ektov i obosnovanie ponyatii informatsii i sluchainosti s pomoschyu teorii algoritmov”, UMN, 25:6(156) (1970), 85–127 | MR | Zbl

[17] A. N. Kolmogorov, “On tables of random numbers”, Sankhya, 25:4 (1963), 369–376 ; A. N. Kolmogorov, “O tablitsakh sluchainykh chisel”, Semiotika i informatika, 18, VINITI, M., 3–13 | MR | Zbl | MR