Voir la notice de l'article provenant de la source Numdam
@article{AIHPB_1978__14_1_113_0, author = {Dies, Jacques-Edouard}, title = {Information et complexit\'e}, journal = {Annales de l'I.H.P. Probabilit\'es et statistiques}, pages = {113--118}, publisher = {Gauthier-Villars}, volume = {14}, number = {1}, year = {1978}, mrnumber = {495063}, zbl = {0389.62003}, language = {fr}, url = {http://geodesic.mathdoc.fr/item/AIHPB_1978__14_1_113_0/} }
Dies, Jacques-Edouard. Information et complexité. Annales de l'I.H.P. Probabilités et statistiques, Tome 14 (1978) no. 1, pp. 113-118. http://geodesic.mathdoc.fr/item/AIHPB_1978__14_1_113_0/
[1] A theory of program size formally identical to information theory, J. A. C. M., t. 22, 1975. | Zbl | MR
,[2] Information et complexité, Ann. Inst. Henri Poincaré, t. XII-4, 1976, p. 365-390. | mathdoc-id | Zbl | MR | EuDML
,[3] La complexité des objets finis..., Russ. Math. Survs., t. 156, 1970. | Zbl
,[4] On the notion of random sequences, Soviet Math. Dokl., t. 15, 1973. | Zbl
,[5] Various measures of complexity for finite objects (axiomatic description), Soviet Math. Dokl., t. 17, 1976. | Zbl
,[6] A unified approach to the definition of random sequences, Math. System Theory, t. 5, 1971. | Zbl | MR
,[7] Process complexity and effective random tests, J. C. S. S., t. 7, 1973. | Zbl | MR
,[8] A survey of the theory of random sequences, in Proceedings of the 5 International Congress of Logic, Methodology and Philosophy of Sciences, 1975.
,[9] Computational complexity and probability constructions, J. A. C. M., t. 17, 1970, p. 241-259. | Zbl | MR
,